Clase 3 Basics of Algorithm Analysis
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=g2jRCGIBbRI
Chapter 2 Basics of Algorithm Analysis • Dr. Rolando Menchaca Méndez • • 00:01 Computational Tractability • 01:33 Polynomial Time • 06:13 Worst-Case of Analysis • 16:36 Worst-case Polynomial-Time • 21:09 Why it Matters? • 27:56 Asymptotic Order of Growth • 44:58 Not Asymptotically tight upper bounds. • 49:16 Notation • 51:16 Properties • 1:06:21 Asymptotic Bounds for Some Common Functions
#############################
