Assignment 8

Next you will be implementing common algorithms using recursion.

Recursion is when a function calls itself. Any algorithm can be implemented recursively or iteratively. Some are easier to implement one way, some another.

Your functions should return a value to the user as appropriate and call no other functions other than themselves.

  1. Write a function that sorts an array. (Mergesort and Quicksort are good examples)

  2. Write a function that finds the max value in an array.

  3. Write a function that prints out every element in an array

  4. Write a function that returns the Greatest Common Divisor of two numbers

  5. Write a function that reverses a string

  6. Write a function that constructs a binary search tree of 20 random numbers. Then write a recursive function that searches that tree for a specific number.