Binary search | Divide and conquer | search algorithm
Binary search can only be performed when the input is sorted. Although, the time complexity is lesser than that of the linear search algorithm, sorted input is the major drawback of binary search algorithm. Apart from this, binary search works best for large sorted inputs.
It's your turn to try changing the algorithm such that it works for decreasing array. And don't forget to hit the like button. Do subscribe for more videos.
Reference: Fundamentals of computer algorithms by Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran
On this page of the site you can watch the video online Binary search | Divide and conquer | search algorithm with a duration of hours minute second in good quality, which was uploaded by the user Aishwarya M 11 June 2021, share the link with friends and acquaintances, this video has already been watched 192 times on youtube and it was liked by 10 viewers. Enjoy your viewing!
