greatbody
/
freeCodeCamp
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

fix(curriculum): typos find by crowdin (#46721) 

* fix(curriculum): typos find by crowdin

* Convert link to standardize one

Co-authored-by: Ilenia <nethleen@gmail.com>

* Josephus function from parameter to parameters

* description of hash from two arrays `arrays' length`

* removed the mention of array length

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

* changed cocktail shaker to cocktail sort

Co-authored-by: Ilenia <nethleen@gmail.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
pull/46768/head
Muhammed Mustafa 2022-06-30 17:44:45 +02:00 committed by GitHub
parent bdd7278f54
commit e2d6b5eb5f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
5 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
View File

@ -8,7 +8,7 @@ dashedName: hash-from-two-arrays
# --description--
Using two arrays of length, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
Example:

2
curriculum/challenges/english/10-coding-interview-prep/rosetta-code/josephus-problem.md
View File

@ -26,7 +26,7 @@ Which number was he?
# --instructions--
Write a function that takes the initial number of prisoners and `k` as parameter and returns the number of the prisoner that survives.
Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
# --hints--

2
curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
View File

@ -8,7 +8,7 @@ dashedName: sorting-algorithmscocktail-sort
# --description--
The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail shaker</a> sort is an improvement on the Bubble Sort. Given an array of numbers, the cocktail shaker sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
# --instructions--

4
curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
View File

@ -10,9 +10,9 @@ dashedName: sorting-algorithmsstrand-sort
The **Strand sort** creates sorted subsets that are merged to create the final result.
Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first element `3` and copy it into a separate array. Search for any bigger element following this element. When you find the a larger element, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following elements to this new value, `4`.
Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
After you have reached the end of the array, remove the elements you copied, `[3, 4]`, and start again with the first element remaining in the `unsortedArray`, in this case `1`.
After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.

2
curriculum/challenges/english/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
View File

@ -8,7 +8,7 @@ dashedName: show-the-local-weather
# --description--
**Objective:** Build a an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
**Rule #1:** Don't look at the example project's code. Figure it out for yourself.