An efficient sorting algorithm - Ultimate Heapsort(UHS)

02/01/2019
by   Feiyang Chen, et al.
0

Motivated by the development of computer theory, the sorting algorithm is emerging in an endless stream. Inspired by decrease and conquer method, we propose a brand new sorting algorithmUltimately Heapsort. The algorithm consists of two parts: building a heap and adjusting a heap. Through the asymptotic analysis and experimental analysis of the algorithm, the time complexity of our algorithm can reach O(nlogn) under any condition. Moreover, its space complexity is only O(1). It can be seen that our algorithm is superior to all previous algorithms.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset