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 O(n) to compute the diameter of a convex polygon
Sources
1. Wikipedia: Computational geometry
WikipediaComputational geometry, lead section, term-origin sentenceQuote, Computational geometry, lead section, term-origin sentence
A groundlaying book in the subject by Preparata and Shamos dates the first use of the term "computational geometry" in this sense by 1975.
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.