Everything about Big O

 1) 

** Literally don't pay too much attention to the definition. We will understand it better by the examples.

*** IMPORTANT FOR REVISION !!!

This Algorithm will take the maximum between 5 and n and as the n increases the time complexity will also increase.

This Algorithm will take the minimum between 5 and n and as the n increases the time complexity will remain constant as 5 will be less than n when  n>5