Data Structures and Algorithms · Foundations

Complexity analysis

Describing how an algorithm's running time or memory grows as input size grows, using Big-O.

Also known as: Big-O, asymptotic notation, time complexity, space complexity.

Start a lesson on Complexity analysis

Leads to

• Recursion: A function solving a problem by calling itself on a smaller version of the same problem.
• Arrays: A fixed-layout, contiguous block of memory where any index is reached in constant time.

Related topics

• Recursion: A function solving a problem by calling itself on a smaller version of the same problem.
• Dynamic programming: Solving a problem by caching answers to overlapping subproblems instead of recomputing them.