[quote=@Bishop]
[@Techspert] I don't get it...

[/quote]

Neither will they, unless they're a computer scientist or a mathematician. Big-O is the upper-bound of an algorithm, which is where an algorithm can no longer increase in the total number/time of steps taken.