BigO notation, complexities and graphs
29 Dec 2020 3 minute read 0 comments icostan
Big-O notation or Big Omicron (e.g. Ο(n)) also called "asymptotic growth" notation is used to represent the worst-case scenario (the upper bound) for a given algorithm. There is also Big Omega (e.g. Ω(n)) the lower bound and Big Theta (e.g. Θ(n)) bot...