Computer Science and Engineering › Divide and Conquer › Question #5729
Single Choice Easy

QWhich of the following is a disadvantage of the binary search algorithm?

ID: #5729 Divide and Conquer 211 views
Question Info
#5729Q ID
EasyDifficulty
Divide and ConquerTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A It only works on sorted lists ✔ ✖
  • B It is slower than linear search for small lists ✔ ✖
  • C It requires a lot of memory ✔ ✖
  • D It can be difficult to implement ✔ ✖
Correct Answer

Explanation

Answer: It only works on sorted lists

Explanation: The binary search algorithm requires that the list be sorted, which can be a disadvantage if the list is not already sorted or if sorting it is expensive.

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

Which of the following is an example of a problem that can be solved using the divide and conquer approach?... What is the main idea behind the divide and conquer approach?... Which of the following is an example of a problem that cannot be solved using the divide and conquer approach?... Which of the following is a disadvantage of the divide and conquer approach?... What is the time complexity of the merge sort algorithm?... What is the time complexity of the binary search algorithm?... Which of the following is an advantage of the divide and conquer approach?... What is the main idea behind the binary search algorithm?... Which of the following is an example of a problem that can be solved using the binary search approach?...