382,221 views 508 on YTPak
1,891 152

Published on 20 Feb 2010 | over 7 years ago

xoax.net/

Lesson Page:
xoax.net/comp_sci/crs/algorithms/lessons/Lesson6/

For this algorithms video lesson, we explain and demonstrate the main asymptotic bounds associated with measuring algorithm performance: big O, big omega, and big theta. in algorithm analysis, we are more with how an algorithm scales than the exact time of execution. This is sometimes referred to as complexity analysis.

Please submit all questions to our forum:
xoax.net/forum/

Copyright 2010 XoaX.net LLC
Customize Your Hybrid Embed Video Player!

6-digit hexadecimal color code without # symbol.

 

Report video function is under development.

 


Loading related videos...