Insertion sort is an in-place sorting algorithm. Insertion sort works by picking each unsorted element and placing it in its correct sorted

Bubble sort works by iterating through the given array multiple times and repeatedly swapping adjacent elements until all elements in the ar

Binary search works only sorted arrays. Binary search divides the given array in the middle into two halves. Hence the name binary search.

Linear search finds the target element by comparing it with all the given elements in the input array, one by one.