Sorting algorithm

Insertion sort is widely used for small data sets, while for large data sets an asymptotically efficient sort is used, primarily heap sort, merge sort, or quicksort

wiki
https://en.wikipedia.org/wiki/Sorting_algorithm


Insertion sort(sort playing cards in our hands)
Heap sort (Binary Heap data structur)
merge sort(merging two halves)