Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Browse By

Time Complexity

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
1949 CE 1
Browse By
Sources
1. Wikipedia: Machine learning
WikipediaMachine learning, History section
Quote, 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.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.