An efficient sorting algorithm - Ultimate Heapsort(UHS)
Data Structures and Algorithms
2019-02-04 v1
Abstract
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.
Cite
@article{arxiv.1902.00257,
title = {An efficient sorting algorithm - Ultimate Heapsort(UHS)},
author = {Feiyang Chen and Nan Chen and Hanyang Mao and Hanlin Hu},
journal= {arXiv preprint arXiv:1902.00257},
year = {2019}
}