Learn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O, Big-Theta, and Big-Omega) to more precisely describe the efficiency.
All video content by Khan Academy is under their license: CC by NC SA
Website created using Khan Academy Static Downloader