Python and Big-O Notation/Computational Complexity:

15. In terms of computational complexity, which is better, an algorithm that is O(n²) or an algorithm that is O(2ⁿ)?

16. When writing a recursive function, what are the two cases for which you must write code?

17. If a recursive function did not have a base case, what would happen when it was called?

18. Write a recursive function to compute the factorial of an integer. The factorial of 0 is 1. The factorial of any integer, n, greater than zero is n times the factorial of n1.