An algorithm is made up of two independent time complexities f(n) and g(n). Then the overall...

 

Transcribed Image Text:

An algorithm is made up of two independent time complexities f(n) and g(n). Then the overall Complexity of the algorithm is: (Example: first line of the algorithm is O(n^2) and rest of the code is in O(n) then what would be the overall Big-O? here min function and max function work like: min(2,3)=2, max(2,3)=3) An algorithm is made up of two independent time complexities f(n) and g(n). Then the overall Complexity of the algorithm is: (Example: first line of the algorithm is O(n^2) and rest of the code is in O(n) then what would be the overall Big-O? here min function and max function work like: min(2,3)=2, max(2,3)=3)