DeepAI AI Chat
Log In Sign Up

An efficient sorting algorithm - Ultimate Heapsort(UHS)

by   Feiyang Chen, et al.

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.


page 1

page 2

page 3


Sorting Real Numbers in O(n√( n)) Time and Linear Space

We present an O(n√( n)) time and linear space algorithm for sorting real...

NNS: The Case For Neural Network-based Sorting

CPU-SIMD/GPU/TPUs will be increasingly powerful. The algorithm using neu...

A Creativity Survey of Parallel Sorting Algorithm

Sorting is one of the most fundamental problems in the field of computer...

Sorting wild pigs

Chjara, breeder in Cargèse, has n wild pigs. She would like to sort her ...

PicArrange – Visually Sort, Search, and Explore Private Images on a Mac Computer

The native macOS application PicArrange integrates state-of-the-art imag...