Assignment

This assignment asks you to implement a number of methods for a class Complexity. These methods should be implemented using for loops, as seen in class (except for the extra-credit one). In addition, each of these methods should print out the value of an accumulator that counts the number of operations performed. The notion of operation should be taken loosely; the idea is that if you are requested to implement a method of time complexity O(n), then it should print out values from 1 to n (or close enough). For example, the following code implements a method that has time complexity O(n):

2

4

6

The methods you should implement are:

• public static void method1(int n): a method that has time complexity O(n²).
• public static void method2(int n): a method that has time complexity O(n³).
• public static void method3(int n): a method that has time complexity O(logn).
• public static void method4(int n): a method that has time complexity O(nlogn).
• public static void method5(int n): a method that has time complexity O(loglogn).
• (Optional) public static int method6(int n): a method that has time complexity O(2ⁿ). For this method you should consider using recursion. This can give you extra points if you miss any points from the previous methods, but the cap for the assignment is 100pts. You can not exceed 100pts with answering this extra-credit question.