Sort the following time complexities in order of execution speed, from slowest to fastest, assuming a sufficiently large input size n. O( n^2 )…
Sort the following time complexities in order of execution speed, from slowest to fastest, assuming a sufficiently large input size n.
O(\(n^2\)), O(log n), O(n!), O(n), O(\(2^n\)), O(1), O(\(n^3\)), O(nlog n), O(\(n^n\)), O(\(\sqrt(n)\) )
From the NPCBL Engineer (Software / Programming) June 2026 – Written (BUET) exam, question 1 of 3.