Bubble sort, sometimes referred to as sinking sort,
is a simple sorting algorithm that repeatedly steps through the list,
compares adjacent elements and swaps them if they are in the wrong order.
The pass through the list is repeated until the list is sorted.

Selection sort is another sorting technique in which we find the
minimum element in every iteration and place it in the array beginning from the first index.
Thus, a selection sort also gets divided into a sorted and unsorted subarray.

Insertion sort is a simple sorting algorithm that builds the final
sorted array one item at a time. It is much less efficient
on large lists than more advanced algorithms such as quicksort,
heapsort, or merge sort.

A sorting technique that sequences a list by continuously dividing the list into two parts
and moving the lower items to one side and the higher items to the other.
It starts by picking one item in the entire list to serve as a pivot point.
The pivot could be the first item or a randomly chosen one.

Merge Sort is a divide and conquer algorithm.
It works by recursively breaking down a problem into two or more
sub-problems of the same or related type, until these become simple
enough to be solved directly. The solutions to the sub-problems are
then combined to give a solution to the original problem.