amyhenning

def collatz(n)
  # set an empty arry to contain the values of the sequence
  ary = []
  # set initial index value to 0
  index = 0

  # start by pushing n into the array
  ary.push(n)
  # loop until the array includes the number 1, i.e. until the sequence is complete
  until ary.include?(1)

amyhenning

def recursive_fib(n)
  # sets the first two values (0 and 1) by default 
  if n < 2
    return n
  # if n is greater than or equal to 2, the nth number in the fibonacci
  # is the sum of the function called on n-1 and the function called on
  # n-2
  else
    return recursive_fib(n-1) + recursive_fib(n-2)
  end

amyhenning

"use strict";

var _ = {
  // Implements:
  // https://lodash.com/docs#map
  map: (array, callback) => {
    return callback(array);
  }
}