Complexity analysis and performance of double hashing sort algorithm (Q2338136): Difference between revisions

@@ Property / cites work @@
+Kinetic sorting and kinetic convex hulls
@@ Property / cites work: Kinetic sorting and kinetic convex hulls / rank @@
+Normal rank
@@ Property / cites work @@
+Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
+Normal rank
@@ Property / cites work @@
+Sorting on graphs by adjacent swaps using permutation groups
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Shellsort
@@ Property / cites work: Randomized Shellsort / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Partitioning for Dual-Pivot Quicksort
@@ Property / cites work: Optimal Partitioning for Dual-Pivot Quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+On the adaptiveness of Quicksort
@@ Property / cites work: On the adaptiveness of Quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+QuickHeapsort: modifications and improved analysis
+Normal rank
@@ Property / cites work @@
+Efficient sorting using registers and caches
@@ Property / cites work: Efficient sorting using registers and caches / rank @@
+Normal rank
@@ Property / cites work @@
+Resource Oblivious Sorting on Multicores
@@ Property / cites work: Resource Oblivious Sorting on Multicores / rank @@
+Normal rank
@@ Property / cites work @@
+Inversion-sensitive sorting algorithms in practice
+Normal rank
@@ Property / cites work @@
+An in-place sorting with             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) comparisons and             <i>O</i>             (             <i>n</i>             ) moves
+Normal rank