diff --git a/src/liballoc/slice.rs b/src/liballoc/slice.rs
index 0802dc3e5007..5f992795531e 100644
--- a/src/liballoc/slice.rs
+++ b/src/liballoc/slice.rs
@@ -218,7 +218,7 @@ pub fn sort(&mut self)
     /// * total and antisymmetric: exactly one of a < b, a == b or a > b is true; and
     /// * transitive, a < b and b < c implies a < c. The same must hold for both == and >.
     ///
-    /// For example, while `f64` doesn't implement `Ord` because `NaN != NaN`, we can use
+    /// For example, while [`f64`] doesn't implement [`Ord`] because `NaN != NaN`, we can use
     /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`.
     ///
     /// ```
diff --git a/src/libcore/slice/mod.rs b/src/libcore/slice/mod.rs
index f6695d876f8d..a9d76376c07b 100644
--- a/src/libcore/slice/mod.rs
+++ b/src/libcore/slice/mod.rs
@@ -1346,7 +1346,7 @@ pub fn sort_unstable(&mut self)
     /// * total and antisymmetric: exactly one of a < b, a == b or a > b is true; and
     /// * transitive, a < b and b < c implies a < c. The same must hold for both == and >.
     ///
-    /// For example, while `f64` doesn't implement `Ord` because `NaN != NaN`, we can use
+    /// For example, while [`f64`] doesn't implement [`Ord`] because `NaN != NaN`, we can use
     /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`.
     ///
     /// ```