Recursive Searching and Sorting (Binary Search, Merge Sort)

AP Computer Science A· difficulty 4/5

Binary search has time complexity

  • A

    O(1)

  • B

    O(n)

  • C

    O(log n)

    check_circle
  • D

    O(n²)

Explanation

Each step halves the search range.

Want 10 more like this — adaptive to your weak spots?

Related questions