Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
If algorithm A and another algorithm B take log2(n) and √n microseconds, respectively, to solve a problem, then the largest size n of a problem these algorithms can solve. respectively. in one second are_____ and _____.
1
\({2^{{{10}^6}}}and\;{10^6}\)
2
\({2^{{{10}^6}}}and\;{10^{{12}}}\)
3
\({2^{{{10}^6}}}and\;{6.10^6}\)
4
\({2^{{{10}^6}}}and\;{6.10^{12}}\)