What is the best growth function to represent the following code fragment? The fragment is parameterized on the variable
Posted: Mon Jun 06, 2022 6:28 pm
What is the best growth function to represent the following code fragment? The fragment is parameterized on the variable n. Assume that you are measuring the number of printin calls. for (int i; i<n; 3) for (int 301 3<n/21 **) System.out.println("More nested loops!"); //count these O-nlog2(n)? O O(nlog3(n)) f(n)=(1/2)nlog3(n) O -(1/2)nlog3(n) O f(n)=nlog3(n)-n/2