diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sort-stability.md
index 3f57407b6af..08a0d3e64f0 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -8,7 +8,7 @@ dashedName: sort-stability
 
 # --description--
 
-When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+When sorting records in a table by a particular column or field, a [stable sort](https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/) will always retain the relative order of records that have the same key.
 
 For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).