diff options
| -rw-r--r-- | src/libcollections/slice.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libcollections/slice.rs b/src/libcollections/slice.rs index 18e4a23fa8d..fc49c9f5643 100644 --- a/src/libcollections/slice.rs +++ b/src/libcollections/slice.rs @@ -1067,7 +1067,7 @@ impl<T> [T] { /// This sort is stable (i.e. does not reorder equal elements) and `O(n log n)` worst-case. /// /// # Current implementation - /// + /// /// The current algorithm is an adaptive, iterative merge sort inspired by /// [timsort](https://en.wikipedia.org/wiki/Timsort). /// It is designed to be very fast in cases where the slice is nearly sorted, or consists of |