Table 1 Range of improvements for the CS and DHS algorithms
From: Complexity analysis and performance of double hashing sort algorithm
n | O(m) < O(n) | O(m) = O(n) | ||
|---|---|---|---|---|
Range of improvements | Average improvements | Range of improvements | Average improvements | |
105 | 45–80% | 62.5% | 88.7–96.8% | 91.9% |
106 | 21.5–56.5% | 34.7% | 58.5–60.7% | 59.9% |
107 | 20–57% | 28.3% | 20–53.8% | 35.4% |
108 | 21–47% | 28.1% | 24.8–43.5% | 33.6% |