An efficient sorting algorithm - Ultimate Heapsort(UHS)

Feiyang Chen, Nan Chen, Hanyang Mao, Hanlin Hu

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment