Searching Algorithms: Binary Search - Complexity Analysis - Problem Set

Download Q&A
Q. In binary search, what happens to the search space after each comparison?
  • A. It doubles
  • B. It halves
  • C. It remains the same
  • D. It increases linearly
Q. Which of the following is a prerequisite for implementing binary search?
  • A. The array must be sorted
  • B. The array must be dynamic
  • C. The array must be of even length
  • D. The array must contain integers only
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