diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md index 1a4a28928c8..3841c9604f1 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md @@ -8,7 +8,7 @@ dashedName: sorting-algorithmspancake-sort # --description-- -Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](). The function should return the sorted array. +Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. The function should return the sorted array. In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so: