Which of the following search algorithms should be used on large arrays if speed is important?
A)Binary
B)Sequential
C)Bubble
D)Selection
E)Insertion

Question

Quizplus · Accepted Answer

Binary search is the most efficient algorithm among the given options as it has a time complexity of O(log n) which is better than the rest of the algorithms. It is used for searching in large sorted arrays as it reduces the number of comparisons needed to find the target value.

Which of the Following Search Algorithms Should Be Used on Large