a) What's the output when we run test ()? int recCount; public void test() { )...

 

Transcribed Image Text:

a) What's the output when we run test ()? int recCount; public void test() { ) for(int im0; i<10; i++) { recCount = 0; pow (i); System.out.print (recCount+","); System.out.println()7 1 public int pow(int n) ( recCount = recCount+1; if(n==0){ return 1; return pow (n-1) + pow (n-1); Output: Describe the runtime of pow(int n): How would you improve the runtime of pow(int n)? b) What's the output when we run test? int count = 0; public void test() { for (int =0; i<5;i++) { count = 0; int[] A= new int [100*4]; for(int i=0; i<A.length; i++) A[i] = 1+1; if(hasDupes (A)) System.out.println("Dupe!"); System.out.println (count); } public boolean hasbupe (int[] A) ( int nA.length; for (int i=0; i<n; i++) { fort int ji+1;j<n; j++)( count++; if(A[i]== A[j]) return true; return false; Output: (cont) Describe the runtime of hasDupe(int[] A) Describe two ways to improve the runtime of hasDupe(int[] A): 2) a) What's the output when we run test ()? int recCount; public void test() { ) for(int im0; i<10; i++) { recCount = 0; pow (i); System.out.print (recCount+","); System.out.println()7 1 public int pow(int n) ( recCount = recCount+1; if(n==0){ return 1; return pow (n-1) + pow (n-1); Output: Describe the runtime of pow(int n): How would you improve the runtime of pow(int n)? b) What's the output when we run test? int count = 0; public void test() { for (int =0; i<5;i++) { count = 0; int[] A= new int [100*4]; for(int i=0; i<A.length; i++) A[i] = 1+1; if(hasDupes (A)) System.out.println("Dupe!"); System.out.println (count); } public boolean hasbupe (int[] A) ( int nA.length; for (int i=0; i<n; i++) { fort int ji+1;j<n; j++)( count++; if(A[i]== A[j]) return true; return false; Output: (cont) Describe the runtime of hasDupe(int[] A) Describe two ways to improve the runtime of hasDupe(int[] A): 2)