Time Complexity

How to describe runtime of an algorithm? There are 3 notations used to describe time complexity. Big O time is an asymptotic notation used to describe the efficiency of algorithms. It describes an upper bound on time. Big omega It is asymptotic lo...