diff --git a/curriculum/challenges/english/blocks/lecture-searching-and-sorting-algorithms/68910fc037a90c285107af04.md b/curriculum/challenges/english/blocks/lecture-searching-and-sorting-algorithms/68910fc037a90c285107af04.md
index 3798a62fe64..2f7b8a7747f 100644
--- a/curriculum/challenges/english/blocks/lecture-searching-and-sorting-algorithms/68910fc037a90c285107af04.md
+++ b/curriculum/challenges/english/blocks/lecture-searching-and-sorting-algorithms/68910fc037a90c285107af04.md
@@ -7,7 +7,7 @@ dashedName: what-is-divide-and-conquer-and-how-does-merge-sort-work
 
 # --description--
 
-The divide and conquer paradigm in computer science is a technique for recursively breaking down problems into smaller sub problems. One of the key aspects of this technique is recursion, which happens when a function calls itself repeatedly until a base case is reached. In this lesson, we will take a look at the merge sort algorithm to better understand how the divide and conquer technique works.
+The divide and conquer paradigm in computer science is a technique for recursively breaking down problems into smaller sub-problems. One of the key aspects of this technique is recursion, which happens when a function calls itself repeatedly until a base case is reached. In this lesson, we will take a look at the merge sort algorithm to better understand how the divide and conquer technique works.
 
 Let's say we had this list of numbers: