TwoWay Counting Position Sort

Nitin Arora, Ashwani Kumar, Surinder Pal Singh

Abstract


Sorting is an algorithm that arranges all elements of an array, orderly. Sorting Technique is frequently used in a large variety of important applications to arrange the data in ascending or descending order. Several Sorting Algorithms of different time and space complexity are exist and used. This paper provides a novel sorting algorithm Two Way Counting Position sort, which is a modified version of Counting Position Sort Algorithm and is based on counting the position of each element in array from both the ends. We have also compared the Two Way Counting Position sort algorithm with Counting Position Sort, Bubble Sort and Selection Sort. We have used the MATLAB 8.0 for implementation and Analysis of CPU time taken by all the four Sorting Algorithms. We have checked the algorithms with random input sequence of length 10, 100, 1000, 5000, 10000, 50000. Result shows that for the small length of input sequence the performance all the three techniques is all most same, but for the large input sequence Selection sort is faster than all the three sorting techniques. Results show that Two Way Counting Position Sort is better than Counting Position Sort for all lengths of inputs.

Keywords

Bubble Sort; Position Sort; Selection Sort; Two Way Counting Position Sort.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.