A(n) ____ search assumes the elements are sorted.
A) bubble
B) linear
C) binary
D) selection

Question

Quizplus · Accepted Answer

Binary search is a search algorithm that works on sorted arrays. It uses a divide and conquer strategy to find a target value within an already sorted array. The array is repeatedly divided into two halves until the target value is found or until there are no more elements to be searched. As a result, binary search has a time complexity of O(log n), which is faster than linear search and bubble sort.

A(n) ____ Search Assumes the Elements Are Sorted