module Recursion where
— | Computes the tribonacci sequence.
— | T(0) = 0, T(1) = 0, T(2) = 1, T(n) = T(n-1) + T(n-2) + T(n-3)
tribonacci :: Integer -> Integer
tribonacci = undefined
— | Chessboard: Given input of n and m,
— | returns a list of all tuples from (1,1) to (n,m)
chessboard :: (Integer, Integer) -> [(Integer, Integer)]
chessboard = undefined
— Work out a suitable type signature to implement the square root
— by method of bisection algorithm.
— bisectSqrt :: ???
bisectSqrt = undefined