#fibswhich takes a number and returns that many members of the fibonacci sequence. Use iteration for this solution.
#fibs_recwhich solves the same problem recursively.
Divide and Conqueralgorithm. Here is some background viewing to understand what merge sort is:
#merge_sortthat takes in an array and returns a sorted array, using a recursive merge sort methodology.
#merge_sort_iterthat achieves merging behaviour, but iteratively rather than recursively.