This dimension sorts algorithms by their basic category, sorting, searching, graph or numerical. Wikipedia defines an algorithm as "any well-defined set of instructions that when followed terminates after a finite number of steps that comprise a solution to a given computational problem." Browsing by category keeps algorithms solving the same kind of problem grouped together.
Facts
Comparison
Era of Emergence Category
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.