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

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
View File

@ -8,7 +8,7 @@ dashedName: stern-brocot-sequence
# --description--
For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence>).
For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence).
<ol>
<li>The first and second members of the sequence are both 1:</li>
@ -36,7 +36,7 @@ For this task, the Stern-Brocot sequence is to be generated by an algorithm simi
# --instructions--
Create a function that returns the $ n^{th} $ member of the sequence using the method outlined above.
Create a function that returns the position in the Stern-Brocot sequence at which $ n $ is first encountered, where the sequence is generated with the method outlined above. Note that this sequence uses 1 based indexing.
# --hints--