Time Complexity

noun

say it: “TYM kum-PLEK-sih-tee” /taɪm kəmˈplɛksɪti/

The pattern of how many steps an algorithm takes as its data grows, written in Big-O notation.

What is time complexity?

Time complexity is the pattern of how many steps an algorithm takes as its data grows, counted in steps rather than seconds so it's the same on every computer. Big-O notation is how it's written, such as O(n).

In a sentence

  • “The assignment asked for the time complexity of my search, so I counted its steps for n items and wrote O(n).”

Level: Journeyman · More Software Development terms at this level

Updated