engineering recuitment GATE CSE 2023-24 Test Series Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
An algorithm is made up of two modules M1 and M2. If order of M1 is f(n) and M2 is g(n) then the order of algorithm is
1
max (f(n), g(n))
2
min (f(n), g(n))
3
f(n) + g(n)
4
f(n) × g(n)