ISRO CS-2023
August 29, 2024ISRO CS-2023
August 29, 2024ISRO CS-2023
| Question 47 |
The asymptotic complexity of 4 functions f1,f2,f3,f4 are
f1(n)=2n
f2(n)=n(3/2)
f3(n)=nlogn
f4(n)=n(log n)
Arrange then in increasing order of complexity
f1(n)=2n
f2(n)=n(3/2)
f3(n)=nlogn
f4(n)=n(log n)
Arrange then in increasing order of complexity
| f2,f3,f4,f1 | |
| f1,f2,f3,f4 | |
| f3,f2,f4,f1
| |
| f3,f1,f2,f4 |
Correct Answer: C
Subscribe
Login
0 Comments