Discussion
For binary search algorithm, which of the following is not a required condition ?
Answer: B
The condition that is not required is an easy mechanism to delete and/or insert elements.
Binary search requires the list to be sorted and needs direct access to the middle element of any sublist, which is why it suits arrays and not linked lists.
Ease of insertion and deletion is not needed to search; arrays make insertion costly and binary search still works on them. So options A and C are requirements, and 'None of the above' is wrong because B is not one.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development