What would you like to Propose? I would like to propose adding Smooth Sort, an optimized variant of Heap Sort developed by Edsger Dijkstra. It adapts to partially sorted data, achieving near-linear ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

1 Energy, Materials and Methods Research Laboratory, National High Polytechnic School of Douala, Douala, Cameroon. 2 National Advanced School of Engineering, University of Yaounde I, Yaounde, Cameroon ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

Abstract: The time complexity of the Counting Sort algorithm is linear and is famous for sorting non-negative integers (0−positive). It runs well for a possible small difference between the smallest ...

The old Babylonian algorithm, a remarkable mathematical artifact from ancient Mesopotamia (around 1800–1600 BC), has long been a subject of fascination to scholars. This ancient algorithm not only ...

We discuss three sorting algorithm that have O(n) time, improving over the O(n log(n)) algorithms by imposing extra requirements on the input elements. Counting Sort: elements are integers in a ...

Abstract: In order to meet the need of real time, electromagnetic environment became more and more complex and increasing signal flow density, a radar signal sorting algorithm based on improved ...