MEDIAN FIRST TOURNAMENT SORT

摘要

Rearrangement of things for making it more usable needs a mechanism to do it with a practically possible time. Sorting techniques are most frequently used mechanism used for rearrangement Selection of a procedure to sort something plays vital role when the amount to be sorted is large. So the procedure must be efficient in both time and space when it comes to the matter of implementation. Several sorting algorithms were proposed in past few decades and some of them like quick sort, merge sort, heap sort etc widely using in real life scenarios since they found their way to be top on the list of sorting mechanisms ever proposed. This paper proposing a Median first Tournament Sort which practically beats quick, merge, and heap sorting mechanisms in terms of time and number of swaps required to sort.