CutShort: A hybrid sorting technique
Ashish Garg, Sudhir Goswami, Versha Garg · 2016
There are many sorting techniques which were developed over the hundreds of years and also optimized to reduce the complexity for worst and average cases. This paper presents a technique, that can be used to optimize the sorting algorithms, named CutShort. The name `CutShort' signifies cutting of original array into shorter pieces. In this technique, the input array is divided into several subarray of shorter lengths based on bit-count, somewhat similar to the Bucket sort concept. Here each sub-arrays contains those elements which can be represented by same number of bits. We have tested this proposed technique on random samples of large input array and the results are very satisfactory. This technique reduces the complexity of worst and average case by a significant factor depending on the number of sub-arrays formed. This method can be used as a preprocessing technique and can be more beneficial if implemented in the processor as a subroutine. It can be used to optimize the runtime of various sorting algorithms.