Evanson Wachira evanson
nathanl
/ traveling_salesman_brute_force_time.rb
Created
February 21, 2015 13:08
How long it takes to solve the Traveling Salesman problem by brute force
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def factorial(n) | |
| (1..n).reduce(:*) | |
| end | |
| SECONDS_PER_STEP = 0.001 | |
| def total_seconds(n) | |
| factorial(n) * SECONDS_PER_STEP | |
| end |