@@ -2995,7 +2995,7 @@ impl<T> [T] {
2995
2995
/// This reordering has the additional property that any value at position `i < index` will be
2996
2996
/// less than or equal to any value at a position `j > index`. Additionally, this reordering is
2997
2997
/// unstable (i.e. any number of equal elements may end up at position `index`), in-place
2998
- /// (i.e. does not allocate), and *O*(*n*) on average. The worst-case performance is *O*(*n* log *n*) .
2998
+ /// (i.e. does not allocate), and runs in *O*(*n*) time .
2999
2999
/// This function is also known as "kth element" in other libraries.
3000
3000
///
3001
3001
/// It returns a triplet of the following from the reordered slice:
@@ -3045,9 +3045,8 @@ impl<T> [T] {
3045
3045
/// This reordering has the additional property that any value at position `i < index` will be
3046
3046
/// less than or equal to any value at a position `j > index` using the comparator function.
3047
3047
/// Additionally, this reordering is unstable (i.e. any number of equal elements may end up at
3048
- /// position `index`), in-place (i.e. does not allocate), and *O*(*n*) on average.
3049
- /// The worst-case performance is *O*(*n* log *n*). This function is also known as
3050
- /// "kth element" in other libraries.
3048
+ /// position `index`), in-place (i.e. does not allocate), and runs in *O*(*n*) time.
3049
+ /// This function is also known as "kth element" in other libraries.
3051
3050
///
3052
3051
/// It returns a triplet of the following from
3053
3052
/// the slice reordered according to the provided comparator function: the subslice prior to
@@ -3101,8 +3100,7 @@ impl<T> [T] {
3101
3100
/// This reordering has the additional property that any value at position `i < index` will be
3102
3101
/// less than or equal to any value at a position `j > index` using the key extraction function.
3103
3102
/// Additionally, this reordering is unstable (i.e. any number of equal elements may end up at
3104
- /// position `index`), in-place (i.e. does not allocate), and *O*(*n*) on average.
3105
- /// The worst-case performance is *O*(*n* log *n*).
3103
+ /// position `index`), in-place (i.e. does not allocate), and runs in *O*(*n*) time.
3106
3104
/// This function is also known as "kth element" in other libraries.
3107
3105
///
3108
3106
/// It returns a triplet of the following from
0 commit comments