From a895ef77f062325f6b9cf7bf7e422a3008c3cd17 Mon Sep 17 00:00:00 2001
From: Lukas Bergdoll <lukas.bergdoll@gmail.com>
Date: Thu, 20 Jun 2024 18:07:04 +0200
Subject: [PATCH] Fix wrong big O star bracing in the doc comments

---
 library/alloc/src/slice.rs    | 6 +++---
 library/core/src/slice/mod.rs | 6 +++---
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/library/alloc/src/slice.rs b/library/alloc/src/slice.rs
index 846f8ba6c6e..c7960b3fb49 100644
--- a/library/alloc/src/slice.rs
+++ b/library/alloc/src/slice.rs
@@ -193,7 +193,7 @@ impl<T> [T] {
     /// The current implementation is based on [driftsort] by Orson Peters and Lukas Bergdoll, which
     /// combines the fast average case of quicksort with the fast worst case and partial run
     /// detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs
-    /// with k distinct elements, the expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// with k distinct elements, the expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// The auxiliary memory allocation behavior depends on the input length. Short slices are
     /// handled without allocation, medium sized slices allocate `self.len()` and beyond that it
@@ -252,7 +252,7 @@ pub fn sort(&mut self)
     /// The current implementation is based on [driftsort] by Orson Peters and Lukas Bergdoll, which
     /// combines the fast average case of quicksort with the fast worst case and partial run
     /// detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs
-    /// with k distinct elements, the expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// with k distinct elements, the expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// The auxiliary memory allocation behavior depends on the input length. Short slices are
     /// handled without allocation, medium sized slices allocate `self.len()` and beyond that it
@@ -298,7 +298,7 @@ pub fn sort_by<F>(&mut self, mut compare: F)
     /// The current implementation is based on [driftsort] by Orson Peters and Lukas Bergdoll, which
     /// combines the fast average case of quicksort with the fast worst case and partial run
     /// detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs
-    /// with k distinct elements, the expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// with k distinct elements, the expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// The auxiliary memory allocation behavior depends on the input length. Short slices are
     /// handled without allocation, medium sized slices allocate `self.len()` and beyond that it
diff --git a/library/core/src/slice/mod.rs b/library/core/src/slice/mod.rs
index 3c818eacca3..d68dde82354 100644
--- a/library/core/src/slice/mod.rs
+++ b/library/core/src/slice/mod.rs
@@ -2893,7 +2893,7 @@ pub fn binary_search_by_key<'a, B, F>(&'a self, b: &B, mut f: F) -> Result<usize
     /// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
     /// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
     /// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
-    /// expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// It is typically faster than stable sorting, except in a few special cases, e.g., when the
     /// slice is partially sorted.
@@ -2950,7 +2950,7 @@ pub fn sort_unstable(&mut self)
     /// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
     /// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
     /// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
-    /// expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// It is typically faster than stable sorting, except in a few special cases, e.g., when the
     /// slice is partially sorted.
@@ -2994,7 +2994,7 @@ pub fn sort_unstable_by<F>(&mut self, mut compare: F)
     /// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
     /// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
     /// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
-    /// expected time to sort the data is *O(*n* \* log(*k*))*.
+    /// expected time to sort the data is *O*(*n* \* log(*k*)).
     ///
     /// It is typically faster than stable sorting, except in a few special cases, e.g., when the
     /// slice is partially sorted.