Required Problems

1. What is the order (i.e. time complexity in Big-Oh notation) of each of the following growth functions?

   1. 10n² + 100n + 1000
   2. 2n³ + 7
   3. 10n log n + 5n² + 3
   4. n³ log n + 2n
   5. n² + 2ⁿ

2. Determine the growth function and time complexity (in Big-Oh notation) of the function foo() defined below. Please show your work by annotating the code.

    function foo(n) { int i=0; while(i 

3. Determine the growth function and time complexity (in Big-Oh notation) of the function bar() defined below. Please show your work by annotating the code.

    function bar(n) { for(int j=0; j 

4. Write a generic method called "findMin" that takes an array of Comparable objects as a parameter. (Use proper syntax, so that no type checking warnings are generated by the compiler.) The method should search the array and return the index of the smallest value. Note that this method will bear a strong resemblance to the linear search algorithm. Include the title of the assignment ("CSC 345 Assignment 2") and your name in a comment block at the top of the Java file.

5. Determine the growth function and time complexity (in Big-Oh notation) of the findMin method from the previous problem. Please show your work by annotating the code.