Skip to content

Commit d34316f

Browse files
committed
Mention that probe::sus corresponds to the number of NDS minus 1
1 parent f995797 commit d34316f

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/Measures-of-presortedness.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -303,7 +303,7 @@ Spearman's footrule distance: sum of distances between the position of individua
303303
#include <cpp-sort/probes/sus.h>
304304
```
305305

306-
Computes the minimum number of non-decreasing subsequences (of possibly not adjacent elements) into which *X* can be partitioned. It happens to correspond to the size of the [longest decreasing subsequence][longest-increasing-subsequence] of *X*.
306+
Computes the minimum number of non-decreasing subsequences (of possibly not adjacent elements) into which *X* can be partitioned, minus 1. It happens to correspond to the size of the [longest decreasing subsequence][longest-increasing-subsequence] of *X* minus 1.
307307

308308
*SUS* stands for *Shuffled Up-Sequences* and was introduced in *Sorting Shuffled Monotone Sequences* by C. Levcopoulos and O. Petersson.
309309

0 commit comments

Comments
 (0)