Two Way Counting Position Sort
Nitin Arora, Anil Kumar, Pramod Mehra · 2012
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,