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 Cubic Time -- O(n^3)
Filter Results6 entries
Sources
1. Wikipedia: Machine learning
WikipediaMachine learning, History sectionQuote, Machine learning, History section
In 1949, Canadian psychologist Donald Hebb published the book The Organization of Behavior, in which he introduced a theoretical neural structure formed by certain interactions among nerve cells.
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.