Algorithm Complexity and Data Structures

Front

What does algorithm efficiency measure?

Back

The computational resources an algorithm uses (time and space).

Front

What is the goal of algorithm efficiency?

Back

Minimize resource usage for optimal performance.

Front

What is time complexity?

Back

Measures execution time as a function of input size.

Front

What does O(1) represent in Big-O notation?

Back

Constant time (independent of input size).

Front

What does O(log n) represent in Big-O notation?

Back

Logarithmic time (runtime increases slowly as input size grows).

Front

What does O(n) represent in Big-O notation?

Back

Linear time (runtime grows proportionally with input size).

Front

What does O(n log n) represent in Big-O notation?

Back

Linearithmic time (common in efficient sorting algorithms).

Front

What does O(n²) represent in Big-O notation?

Back

Quadratic time (runtime grows exponentially with input size).

Front

What is an example of an algorithm with O(n) time complexity?

Back

Linear Search.

Front

What does space complexity measure?

Back

Memory usage based on input size.