Complexity analysis and performance of double hashing sort algorithm
From MaRDI portal
(Redirected from Publication:2338136)
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
- Efficient sorting using registers and caches
- Introduction to algorithms.
- Inversion-sensitive sorting algorithms in practice
- Kinetic sorting and kinetic convex hulls
- On the adaptiveness of Quicksort
- Optimal partitioning for dual-pivot quicksort
- Randomized shellsort: a simple data-oblivious sorting algorithm
- Resource oblivious sorting on multicores
- Sorting on graphs by adjacent swaps using permutation groups
This page was built for publication: Complexity analysis and performance of double hashing sort algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2338136)