XVII. (2 points) What is the big O time complexity of the following method in terms...

 

Transcribed Image Text:

XVII. (2 points) What is the big O time complexity of the following method in terms of n? public static int fun(int n) { if (n <0) return 0; if (n = 1) return 1; if (n%2==0) else return fun(n-1)+1; } return fun(n-2) + 2; XVIII. (2 points) What is the big O time complexity of the following method in terms of n? public void printBoard(int a[][]) { int n = a.length(); for (i=0; i <8; i++) { for (j=0; j <8; j++) if (a[i][j] != 0) elese System.out.print("*"); System.out.print("-"); System.out.println(); } } 14 XVII. (2 points) What is the big O time complexity of the following method in terms of n? public static int fun(int n) { if (n <0) return 0; if (n = 1) return 1; if (n%2==0) else return fun(n-1)+1; } return fun(n-2) + 2; XVIII. (2 points) What is the big O time complexity of the following method in terms of n? public void printBoard(int a[][]) { int n = a.length(); for (i=0; i <8; i++) { for (j=0; j <8; j++) if (a[i][j] != 0) elese System.out.print("*"); System.out.print("-"); System.out.println(); } } 14