Insertion sort is a simple and efficient sorting algorithm that works the way we sort playing cards in our hands. It is based on the idea that one element from the input elements is consumed in each iteration

Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to last. We compare each pairs of elements and swapping them if they are in wrong order.

Selection Sort is an in-place sorting algorithm. The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.