diff --git a/curriculum/challenges/english/blocks/workshop-merge-sort-js/69b2762b17d23fbee40a6c00.md b/curriculum/challenges/english/blocks/workshop-merge-sort-js/69b2762b17d23fbee40a6c00.md
index 512d37f38ad..de5af3e8149 100644
--- a/curriculum/challenges/english/blocks/workshop-merge-sort-js/69b2762b17d23fbee40a6c00.md
+++ b/curriculum/challenges/english/blocks/workshop-merge-sort-js/69b2762b17d23fbee40a6c00.md
@@ -13,7 +13,7 @@ The merge sort algorithm performs three actions:
 - Sort the items in the sub-parts
 - Merge the sorted sub-parts
 
-The above happens recursively until the sub-parts are merged into the complete sorted sequence. Let's start by dividing the sequence.
+The above happens recursively until the sub-parts are merged into the complete sorted sequence. Start by dividing the sequence.
 
 First, inside the `mergeSort` function, declare a variable `middlePoint` using `const` and assign it `Math.floor(array.length / 2)` so you can split the sequence in half before recursing.