WCSE 2016
ISBN: 978-981-11-0008-6 DOI: 10.18178/wcse.2016.06.106

SONIK: Efficient In-Situ All Item Rank Generation Using Bit Operations

Sourav Dutta

Abstract— Sorting, a classical combinatorial process, forms the bedrock of numerous algorithms with varied applications. A related problem involves efficiently finding the corresponding ranks of all the elements – catering to rank queries, data partitioning and allocation, etc. Although, the element ranks can be subsequently obtained by initially sorting the elements, such procedures involve O(n log n) computations and might not be suitable with large input sizes for hard real-time systems or for applications with data reordering constraints. This paper proposes SONIK, a non-comparison linear time and space algorithm using bit operations inspired by radix sort for computing the ranks of all input integer elements, providing implicit sorting. The element ranks are generated in-situ without re-ordering or using other sorting mechanism.

Index Terms— all item rank computation, integer sort, non-comparison sort, bit operations, linear time.

Sourav Dutta
Max Planck Institute for Informatics, GERMANY


Cite: Sourav Dutta, "SONIK: Efficient In-Situ All Item Rank Generation Using Bit Operations," Proceedings of 2016 6th International Workshop on Computer Science and Engineering, pp. 613-617, Tokyo, 17-19 June, 2016.