If an array is known to be sorted,it can be searched very quickly by using
A) sequential search
B) binary search
C) selection search
D) None of the above

Question

Quizplus · Accepted Answer

Binary search is the best choice for a sorted array as it has a time complexity of O(log n), compared to sequential search which has a time complexity of O(n) and selection search which also has a time complexity of O(n). Therefore, binary search is the most efficient way to search a sorted array.

If an Array Is Known to Be Sorted,it Can Be