• Sunil Gupta
• Vinita Gupta

this work proposes a totally new sorting algorithm named as SSGM Sort. This sorting algorithm not only breaches lower bounds of time complexity but minimizes other requirements also like Space Complexity, Adaptive, Structural Complexity, Processor complexity etc.. SSGM Sorting Algorithm is in-place sequential algorithm which exhibits O(n log n) comparisons in worst case, O(n) comparisons in best case, O(n log √n) in average case which is ultimately breaching the limits of Ω(n log n) explicitly. Other requirements are also minimized as space complexity is O(1) in all the cases. The time complexity of O(n log n) with space complexity of O(1) together is not achieved by any other algorithm. Here SSGM sorting algorithm uses simple array movements with itself, so we need not to maintain any other complicated data structure. SSGM Sorting rather sets an upper bound of O(n log n).

SSGM Sort, Lower Bound Theorem, Comparison based Sorting, Time Complexity, Space Complexity, Adaptive Sort, Structural Complexity, Bandwith Complexity, Interface Complexity, Stable Sorting.

"SSGM Sort Algorithm to Breach Lower Bounds of Comparison Based Sorting", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.236-241, November-2018, Available :http://www.jetir.org/papers/JETIR1811B39.pdf

"SSGM Sort Algorithm to Breach Lower Bounds of Comparison Based Sorting", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp236-241, November-2018, Available at : http://www.jetir.org/papers/JETIR1811B39.pdf