freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.english.md

id, title, challengeType, isHidden, forumTopicId

id	title	challengeType	isHidden	forumTopicId
5a23c84252665b21eecc8028	Stern-Brocot sequence	5	false	302324

Description

For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the Fibonacci sequence.

1. The first and second members of the sequence are both 1:
• 1, 1
2. Start by considering the second member of the sequence
3. Sum the considered member of the sequence and its precedent, (1 + 1) = 2, and append it to the end of the sequence:
• 1, 1, 2
4. Append the considered member of the sequence to the end of the sequence:
• 1, 1, 2, 1
5. Consider the next member of the series, (the third member i.e. 2)
6. GOTO 3
• ─── Expanding another loop we get: ───
7. Sum the considered member of the sequence and its precedent, (2 + 1) = 3, and append it to the end of the sequence:
• 1, 1, 2, 1, 3
8. Append the considered member of the sequence to the end of the sequence:
• 1, 1, 2, 1, 3, 2
9. Consider the next member of the series, (the fourth member i.e. 1)

Instructions

Create a function that returns the $ n^{th} $ member of the sequence using the method outlined above.

Tests

tests:
  - text: <code>sternBrocot</code> should be a function.
    testString: assert(typeof sternBrocot == 'function');
  - text: <code>sternBrocot(2)</code> should return a number.
    testString: assert(typeof sternBrocot(2) == 'number');
  - text: <code>sternBrocot(2)</code> should return <code>3</code>.
    testString: assert.equal(sternBrocot(2), 3);
  - text: <code>sternBrocot(3)</code> should return <code>5</code>.
    testString: assert.equal(sternBrocot(3), 5);
  - text: <code>sternBrocot(5)</code> should return <code>11</code>.
    testString: assert.equal(sternBrocot(5), 11);
  - text: <code>sternBrocot(7)</code> should return <code>19</code>.
    testString: assert.equal(sternBrocot(7), 19);
  - text: <code>sternBrocot(10)</code> should return <code>39</code>.
    testString: assert.equal(sternBrocot(10), 39);

Challenge Seed

function sternBrocot(num) {
  // Good luck!
}

Solution

function sternBrocot(num) {
  function f(n) {
    return n < 2
      ? n
      : n & 1
      ? f(Math.floor(n / 2)) + f(Math.floor(n / 2 + 1))
      : f(Math.floor(n / 2));
  }

  function gcd(a, b) {
    return a ? (a < b ? gcd(b % a, a) : gcd(a % b, b)) : b;
  }
  var n;
  for (n = 1; f(n) != num; n++);
  return n;
}