SONIK：基于位运算的有效的全项目排序生成
SONIK: Efficient In-situ All Item Rank Generation using Bit Operations
摘要：
排序，一个经典的组合过程，形成了许多算法的基础，具有不同的应用。一个相关的问题涉及到有效地找到相应的排名的所有元素-迎合排名查询，数据分区和分配等，虽然，元素排名可以随后通过最初排序的元素，这样的程序涉及O（n log n）的计算，并可能不适合硬实时系统或应用程序的大输入大小与数据重新排序的限制。本文提出了SONIK，一个非比较线性时间和空间算法，使用位操作的启发基数排序计算所有输入整数元素的秩，从而提供隐式排序。元素等级是原位生成的，即，直接在相应的元件位置处，而无需重新排序或求助于任何其它分类机构。
英文摘要：
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 re-ordering 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, thereby providing implicit sorting. The element ranks are generated in-situ, i.e., directly at the corresponding element position without re-ordering or recourse to any other sorting mechanism.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
