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

fix(curriculum): remove example function calls from seed (#42797)

Browse Source
This commit is contained in:
tristansoriaga
2021-07-13 23:37:38 +08:00
committed by GitHub
parent e97c302c3d
commit 5e8ac21c26
4 changed files with 4 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -52,7 +52,7 @@ assert(
); );
``` ```
`bubbleSort` should return an array that is unchanged except for order. `bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
```js ```js
assert.sameMembers( assert.sameMembers(
@ -113,8 +113,6 @@ function bubbleSort(array) {
return array; return array;
// Only change code above this line // Only change code above this line
} }
bubbleSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
``` ```
# --solutions-- # --solutions--

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

@ -48,7 +48,7 @@ assert(
); );
``` ```
`insertionSort` should return an array that is unchanged except for order. `insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
```js ```js
assert.sameMembers( assert.sameMembers(
@ -109,8 +109,6 @@ function insertionSort(array) {
return array; return array;
// Only change code above this line // Only change code above this line
} }
insertionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
``` ```
# --solutions-- # --solutions--

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

@ -56,7 +56,7 @@ assert(
); );
``` ```
`mergeSort` should return an array that is unchanged except for order. `mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
```js ```js
assert.sameMembers( assert.sameMembers(
@ -117,8 +117,6 @@ function mergeSort(array) {
return array; return array;
// Only change code above this line // Only change code above this line
} }
mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
``` ```
# --solutions-- # --solutions--

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

@ -48,7 +48,7 @@ assert(
); );
``` ```
`selectionSort` should return an array that is unchanged except for order. `selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
```js ```js
assert.sameMembers( assert.sameMembers(
@ -109,9 +109,6 @@ function selectionSort(array) {
return array; return array;
// Only change code above this line // Only change code above this line
} }
selectionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
``` ```
# --solutions-- # --solutions--