BINARY SEARCH algorithm explained must watch

Published: 31 January 2022
on channel: 1M Coders

Binary Search

Given a sorted array arr[] of n elements, write a function to search a given element x in arr[].
A simple approach is to do a linear search. The time complexity of the above algorithm is O(n). Another approach to perform the same task is using Binary Search.
Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(Log n).

On this page of the site you can watch the video online BINARY SEARCH algorithm explained must watch with a duration of hours minute second in good quality, which was uploaded by the user 1M Coders 31 January 2022, share the link with friends and acquaintances, this video has already been watched 13 times on youtube and it was liked by 2 viewers. Enjoy your viewing!