campus placement AMCAT Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Main ( )
{
\(n = {2^2}^k\)
for (i = 2; i ≤ n; i = i2)
{
j = 1;
while (j ≤ i)
{
prinf("Hello World");
j ++;
}
}
How many times Hello World is printed ?1
\(\mathop \sum \limits_{i = 1}^k {2^{{2^i}}}\)
2
\(\mathop \sum \limits_{i = 1}^n {2^i}\)
3
\(\mathop \sum \limits_{i = 1}^n {2^{{2^i}}}\)
4
\(\mathop \sum \limits_{i = 1}^k {2^i}\)