diff --git a/library/core/src/slice/sort/stable/mod.rs b/library/core/src/slice/sort/stable/mod.rs
index f9034e1b4d8e..3d3fe2e70b7b 100644
--- a/library/core/src/slice/sort/stable/mod.rs
+++ b/library/core/src/slice/sort/stable/mod.rs
@@ -14,10 +14,10 @@ pub(crate) mod quicksort;
 
 /// Stable sort called driftsort by Orson Peters and Lukas Bergdoll.
 /// Design document:
-/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/driftsort_introduction/text.md
+/// <https://github.com/Voultapher/sort-research-rs/blob/main/writeup/driftsort_introduction/text.md>
 ///
 /// Upholds all safety properties outlined here:
-/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort_safety/text.md
+/// <https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort_safety/text.md>
 #[inline(always)]
 pub fn sort<T, F: FnMut(&T, &T) -> bool, BufT: BufGuard<T>>(v: &mut [T], is_less: &mut F) {
     // Arrays of zero-sized types are always all-equal, and thus sorted.
diff --git a/library/core/src/slice/sort/unstable/mod.rs b/library/core/src/slice/sort/unstable/mod.rs
index 0d0fbd74b388..692c2d8f7c7b 100644
--- a/library/core/src/slice/sort/unstable/mod.rs
+++ b/library/core/src/slice/sort/unstable/mod.rs
@@ -11,10 +11,10 @@ pub(crate) mod quicksort;
 
 /// Unstable sort called ipnsort by Lukas Bergdoll.
 /// Design document:
-/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/ipnsort_introduction/text.md
+/// <https://github.com/Voultapher/sort-research-rs/blob/main/writeup/ipnsort_introduction/text.md>
 ///
 /// Upholds all safety properties outlined here:
-/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort_safety/text.md
+/// <https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort_safety/text.md>
 #[inline(always)]
 pub fn sort<T, F: FnMut(&T, &T) -> bool>(v: &mut [T], is_less: &mut F) {
     // Arrays of zero-sized types are always all-equal, and thus sorted.