Quick sort

https://makolyte.com/multithreaded-quicksort-in-csharp/

https://www.youtube.com/watch?v=ZHVk2blR45Q nice

In Merge sort, I am reducing number of comparisons. e.g No. 2 is compared with 6, 1, 3 and not with 8 and 9

Simple and slow. Compare with multiple iteration, until all sorted.

Sorted part need not be compared again

Selection sort

Select the smallest on every iteration, but every next iteration should start with 2, 3, … position onwards

Heap sort

Every time, take out the root and keep aside, and move the right hand side last number 5 to root and trickle down

And trickle down the heap and now repeat for 19