In this method, a pivot point is chosen from the array. The array is reordered so that all values smaller than the pivot are moved before it and all values larger than the pivot are moved after it, with values equaling the pivot going either way. When this is done, the pivot is in its final position. The above step is repeated for each subarray of smaller values as well as done separately for the subarray with greater values.
This is repeated until the entire array is sorted.

Binary Search Algorithm

Bubble Sort

Insertion Sort

Linear Search Algorithm

Merge Sort

Quick Sort

Selection Sort