Data Structures and Algorithms20745 marksAsymptotic notations and common functions
Describe the Big 'O' notation.
Describe the Big 'O' notation. [5]
Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity. In computer science, Big O notation is used to classify algorithms according to how their running time or space requirement grows as the in...