Testing GFM

gistfile1.md

Heading 1

Some Q code

fib: {[n]
  $[n<2; n; fib[n-1]+fib[n-2]]
}

Heading 2

This is some Haskell code:

fib :: Int -> Int
fib n = if n < 2
  then n
  else fib (n-1) + fib (n-2)

Heading 3

and some Python code:

def fib(n):
  if n < 2:
    return n
  else:
    return fib(n-1) + fib(n-2)  

Heading 4

and some Matlab code:

function k = fib(n)
  if n < 2
    k = n;                    % base case
  else
    k = fib(n-1) + fib(n-2);  % inductive case
  end
end

Heading 5

some C code

int fib(int n) {
  if (n < 2) {
    return n;
  } else {
    return fib(n-1) + fib(n-2);
  }
}

Heading 6

some Lisp code

(define (fib n)
  (if (< n 2)
      n
      (+ (fib (- n 1)) (fib (- n 2)))))