Searching Algorithms: Binary Search - Implementations in Python - Applications

Download Q&A
Q. In a binary search algorithm, what happens to the search space after each comparison?
  • A. It doubles
  • B. It remains the same
  • C. It halves
  • D. It increases linearly
Q. What is the space complexity of the iterative implementation of binary search?
  • A. O(n)
  • B. O(log n)
  • C. O(1)
  • D. O(n log n)
Showing 1 to 2 of 2 (1 Pages)
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely