In this sorting algorithm we divide adjacent elements into “bubbles” and repeatedly swap them if they are in the wrong order, until there are no more swaps possible.

Binary search is a search algorithm that cuts down the time taken by linear search by a great amount.In this algorithm, instead of comparing the values of each element, we compare the given value with the middle most element and recursively halve the sorted array.