gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(learn): Removed note about commented array from sorting algorithm challenges (#40652)

Browse Source
This commit is contained in:
Sergey Rufanov
2021-01-17 06:00:10 +10:00
committed by GitHub
parent 594b63bc35
commit 5379b04387
4 changed files with 0 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.md
View File

@@ -16,9 +16,6 @@ This method requires multiple iterations through the array and for average and w
**Instructions:** Write a function `bubbleSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
**Note:**
We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
# --hints--
`bubbleSort` should be a function.

3
curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.md
View File

@@ -12,9 +12,6 @@ The next sorting method we'll look at is insertion sort. This method works by bu
**Instructions:** Write a function `insertionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
**Note:**
We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
# --hints--
`insertionSort` should be a function.

3
curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.md
View File

@@ -20,9 +20,6 @@ As an aside, this will be the last sorting algorithm we cover here. However, lat
**Instructions:** Write a function `mergeSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. A good way to implement this is to write one function, for instance `merge`, which is responsible for merging two sorted arrays, and another function, for instance `mergeSort`, which is responsible for the recursion that produces single-item arrays to feed into merge. Good luck!
**Note:**
We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
# --hints--
`mergeSort` should be a function.

3
curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.md
View File

@@ -12,9 +12,6 @@ Here we will implement selection sort. Selection sort works by selecting the min
**Instructions**: Write a function `selectionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
**Note:**
We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging `array` to see your sorting algorithm in action!
# --hints--
`selectionSort` should be a function.