We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 11ede68 commit e02f923Copy full SHA for e02f923
src/libcollections/slice.rs
@@ -1067,7 +1067,7 @@ impl<T> [T] {
1067
/// This sort is stable (i.e. does not reorder equal elements) and `O(n log n)` worst-case.
1068
///
1069
/// # Current implementation
1070
- ///
+ ///
1071
/// The current algorithm is an adaptive, iterative merge sort inspired by
1072
/// [timsort](https://en.wikipedia.org/wiki/Timsort).
1073
/// It is designed to be very fast in cases where the slice is nearly sorted, or consists of
0 commit comments