Binary Search

Problem:
How to find an element in a sorted array using Binary Search.

Solution:
1: Take start = 0, end = length of array - 1.
2: Repeat following steps till start is less than or equal to end:
(a) Set mid = (start + end)/2.
(b) Check if array[mid] == num, then return mid.
(c) If num is less than array[mid], set end = mid-1, to look for num in first half of the array.
(d) Else set start = mid+1, to look for num in second half of the array.
3: Return -1.

Code and Algorithm Visualization: http://www.ideserve.co.in/learn/binary-search-in-a-sorted-array

Binary Search Playlist: https://www.youtube.com/playlist?list=PLamzFoFxwoNhR2uFoqm6nr8VgsERgTmYy

Website: http://www.ideserve.co.in

Facebook: https://www.facebook.com/IDeserve.co.in

Видео Binary Search канала IDeserve