From 4921d5834985389dd8c2e078d7bd12fea0fc396a Mon Sep 17 00:00:00 2001 From: Clarence Bakosi Date: Thu, 14 May 2026 19:57:06 +0100 Subject: [PATCH] fix(curriculum): remove first person language from merge sort JS workshop (#67401) --- .../blocks/workshop-merge-sort-js/69b2762b17d23fbee40a6c00.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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.