294,156 views 495 on YTPak
1,258 44

Published on 04 Dec 2012 | over 4 years ago

See complete series on time complexity here
In this lesson, we will see how to deduce an expression for running time of a program/algorithm as a function of input size. We define a hypothetical model machine where our algorithm may execute and try to calculate the growth function for running time. Then we classify these functions into broad sets using big-oh or other asymptotic notations.

Pre-requisite: Basic knowledge of programming concepts.

Loading related videos...