Fix complexity of spreadsort based on the Boost.Sort README

Morwenn · Jan 13, 2024 · dcb53ae · dcb53ae
1 parent 4312d48
commit dcb53ae
Showing 1 changed file with 5 additions and 3 deletions.
diff --git a/docs/Sorters.md b/docs/Sorters.md
@@ -583,9 +583,11 @@ This sorter accepts projections, as long as `ska_sorter` can handle the return t
 
 `spread_sorter` implements a [spreadsort][spreadsort].
 
-| Best        | Average     | Worst       | Memory      | Stable      | Iterators     |
-| ----------- | ----------- | ----------- | ----------- | ----------- | ------------- |
-| n           | n*(k/d)     | n*(k/s+d)   | n*(k/d)     | No          | Random-access |
+| Best        | Average     | Worst             | Memory      | Stable      | Iterators     |
+| ----------- | ----------- | ----------------- | ----------- | ----------- | ------------- |
+| n           | n √log n    | min(n log n, n*k) | k           | No          | Random-access |
+
+_Note: `k` represents the key length in bits in the in table above._
 
 It comes into three main flavours (available individually if needed):