`then be` -> `be` based on feedback from @ibraheemdev

1 files changed, 3 insertions, 3 deletions

diff --git a/library/core/src/slice/mod.rs b/library/core/src/slice/mod.rs
index abe5a5acf3b..03c21507aec 100644
--- a/library/core/src/slice/mod.rs
+++ b/library/core/src/slice/mod.rs
@@ -3070,7 +3070,7 @@ impl<T> [T] {
     }
 
     /// Reorders the slice such that the element at `index` is at a sort-order position. All
-    /// elements before `index` will then be `<=` this value, and all elements after will be `>=`.
+    /// elements before `index` will be `<=` this value, and all elements after will be `>=`.
     ///
     /// This reordering is unstable (i.e. any element that compares equal to the nth element may end
     /// up at that position), in-place (i.e.  does not allocate), and runs in *O*(*n*) time. This
@@ -3129,8 +3129,8 @@ impl<T> [T] {
     }
 
     /// Reorders the slice with a comparator function such that the element at `index` is at a
-    /// sort-order position. All elements before `index` will then be `<=` this value, and all
-    /// elements after will be `>=` according to the comparator function.
+    /// sort-order position. All elements before `index` will be `<=` this value, and all elements
+    /// after will be `>=` according to the comparator function.
     ///
     /// This reordering is unstable (i.e. any element that compares equal to the nth element may end
     /// up at that position), in-place (i.e.  does not allocate), and runs in *O*(*n*) time. This