Geo-Mean Sort
Safal Pandita · 2013
Sorting is an algorithm used to arrange all elements of a list in an order. It can be arranged in increasing as well as decreasing order. Several sorting algorithms with various time and s pace complexities exist already due to the very important applications of sorting . This paper proposes an algorithm which is a modification of counting sort and bucket sort to produce a new stable sorting algorithm having better space complexity than counting sort without affecting it's time complexity and better worst case time complexity than generic bucket sort. It also has better time complexity than any comparison based sorting algorithm as it is not bound by O(n*log(n)) .It's best case complexity is O(n) whereas worst case complexity is O(m+n). The space complexity is (√mn + n ). Hence it is concluded from experimental and theoretical observations that this algorithm can replace counting sort and is also better than the generic bucket sort implementation .