This dimension groups algorithms by their time complexity, how the time an algorithm takes grows with the size of its input. Wikipedia notes that an algorithm "terminates after a finite number of steps," and how many steps it needs is exactly what time complexity measures. Browsing by time complexity keeps algorithms of a similar efficiency grouped together.
Facts
Comparison
Era of Emergence Polynomial time
Sources
1. Wikipedia: Mathematical optimization
WikipediaMathematical optimization, History sectionQuote, Mathematical optimization, History section
The term "linear programming" for certain optimization cases was due to George B. Dantzig, although much of the theory had been introduced by Leonid Kantorovich in 1939.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.