engineering recuitment GATE CSE 2023-24 Test Series Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Consider the code given below:
for(int i =1; i for(int j=1;j < i; j=j+2){ for(int k =1; k printf(“GATE2021”); } } } The number of times GATE2021 will be printed asymptotically?
1
(N3)logn
2
(N2)logn
3
Nlogn
4
(N4)logn