Big O, Big Theta, Big Omega
Best Case, Expected Case, Worst Case Scenarios for Time and Size Complexities
What is Big O?
Big O can be described as a metric or language used to describe and compare efficiency of computer algorithms and data structures. Such notations are used to perform analysis of any computer algorithm.
BigO can be stated as O(1) – Constant, O(n) – Linear, O(log n) – Logarithmic, O(n^2) -Quadratic and many more such.
Thanks for watching!!
Do let me know if you have any questions/doubts in the comments section below. I will surely reply each one of you within a day.