Question

Hey, I really need help understanding the math get the answer that is given. Please help. Thanks in advance.

for (int k =0; k s Ign; k++) {for (int i =0; is n2; i++) Print “Hello World"; for (int j =0; j s n; j++) Print “Hello World"; } When n = 2, how many times will “Hello World” be printed?16 When n =4, how many times will “Hello World” be printed? 66 Assuming that the print is the basic operation, what is the complexity function of this pseudocode? Tin) = (2+n+2)(egn+1)

Answer 1

for (int k =0; k s Ign; k++) This statement will be executed (1gn ++) times {for (int i =0; i s n2; i++) Print “Hello World"; for each value of K, this will be executed (n²+1) times for (int j =0;j s n; j++) Print “Hello World"; } for each value of K, this will be executed (n+1) times When n = 2, how many times will “Hello World” be printed? 166 (192+1) (2 + 2+2) = 2x8=16 When n =4, how many times will “Hello World" be printed? 66 » (lgu + 1) (u+tu+1) 3x22=66 Assuming that the print is the basic operation, what is the complexity function of this pseudocode? (2n+2)/egn+1) + (Agn +1) (72 +1 +n+1) = (light) (n²+n+2)

IF YOU UNDERSTOOD IT CLEARLY, PLEASE LIKE/UPVOTE ?

OTHERWISE, FEEL FREE TO ASK IN COMMENT SECTION ?

I WILL SURELY HELP YOU!! THANK YOU!! ?