Modified Counting sort

There are various sorting methods in the literature which are sequential in nature and have linear time complexity. But these methods are not preferred to use due to large memory requirements in specific cases. Counting sort is one, which lies in this domain. In this paper we have suggested an improvement on the counting sort. Due to this improvement the memory requirement for counting sort is reduced up to a significant level. We have tested this modified counting sort on numerous data sets and the results obtained by these experiments are very much satisfactory. Results shows that this memory requirement is reduced at least 50% than traditional counting sort. So it open up the opportunity of using this modified version in many sorting application.