What are some practice problems for Big O notation?

What are some practice problems for Big O notation?

Here are a few practice problems for Big O notation:

1. Analyze the time complexity of a binary search algorithm.
2. Determine the Big O of a nested loop that iterates over an array.
3. What is the time complexity of merging two sorted arrays?

Can you explain the time complexity of a binary search?

Sure! The time complexity of a binary search is O(log n) because it divides the search space in half with each iteration.

What about the nested loop problem?

For a nested loop that iterates over an array of size n, the time complexity is O(n^2) because for each element in the outer loop, the inner loop runs n times.

Can you give me a real-world example of O(n log n)?

A common real-world example of O(n log n) is the time complexity of efficient sorting algorithms like mergesort or heapsort.