Inversion-sensitive sorting algorithms in practice
From MaRDI portal
Recommendations
Cited in
(7)- An introduction to three algorithms for sorting in situ
- The weak-heap data structure: variants and applications
- Complexity analysis and performance of double hashing sort algorithm
- scientific article; zbMATH DE number 2163028 (Why is no real title available?)
- Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
- An empirical study for inversions-sensitive sorting algorithms
- Cache-aware and cache-oblivious adaptive sorting
This page was built for publication: Inversion-sensitive sorting algorithms in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406181)