Complexity analysis and performance of double hashing sort algorithm
From MaRDI portal
Publication:2338136
DOI10.1186/s42787-019-0004-2zbMath1493.68130OpenAlexW2941856566MaRDI QIDQ2338136
Publication date: 21 November 2019
Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s42787-019-0004-2
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- QuickHeapsort: modifications and improved analysis
- Kinetic sorting and kinetic convex hulls
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
- Sorting on graphs by adjacent swaps using permutation groups
- An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
- Resource Oblivious Sorting on Multicores
- Optimal Partitioning for Dual-Pivot Quicksort
- On the adaptiveness of Quicksort
- Randomized Shellsort
- Inversion-sensitive sorting algorithms in practice
- Efficient sorting using registers and caches