gitadmin/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-05-28 18:26:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(curriculum): remove first person language from merge sort workshop (#67399)

Browse Source
This commit is contained in:
Clarence Bakosi
2026-05-14 19:46:11 +01:00
committed by GitHub
parent ef9595b92d
commit 68d5afb54a
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
curriculum/challenges/english/blocks/learn-data-structures-by-building-the-merge-sort-algorithm/6564aee9c077774ea49c3faf.md
+1 -1
View File
@@ -13,7 +13,7 @@ The merge sort algorithm mainly 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, replace the `pass` keyword with a variable `middle_point`. Use the integer division operator (`//`) to divide the length of the `array` list by 2 and assign the result to your new `middle_point` variable. Remember to indent your code.
curriculum/challenges/english/blocks/workshop-merge-sort/6564aee9c077774ea49c3faf.md
+1 -1
View File
@@ -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, replace the `pass` keyword with a variable `middle_point`. Use the integer division operator (`//`) to divide the length of the `array` list by 2 and assign the result to your new `middle_point` variable. Remember to indent your code.