Question: 3) (10 pts) The following algorithm is given: public static void printStar(int n) while(n>0) { { for (i=1 to n) System.out.print(*); n=n/2; } }
3) (10 pts) The following algorithm is given: public static void printStar(int n) while(n>0) { { for (i=1 to n) System.out.print("*"); n=n/2; } } a) What is input length? b) What is growth function? c) What is the complexity of the algorithm?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
