Asymptotic analysis and growth of functions
Design and Analysis of Algorithms · Engineering
Study notes
Compare n^2 vs 2^n: at n=10, 100 vs 1024; at n=50, 2500 vs 10^15. The exponential eventually dwarfs any polynomial, which is why brute-force subset algorithms (O(2^n)) fail beyond n=40 while polynomial ones scale. This crossover thinking picks feasible algorithms.