Lecture 22: Big Oh and Theta

Om kurset

This lecture explores how to compare the efficiency of algorithms by using notation that describes growth independent of machine or specific implementation. It shows how to use Theta to describe asymptotic order of growth as well as upper and lower bounds.