Lecture 5: RAM model, Exact Algorithm Analysis, Complexity Classes, Big-Oh[Advanced Data Structures]

Thank you for your time.  In this lecture I discuss the idea of a model of computation, how we use the Random Access Machine (RAM) model to analyze algorithms.  We consider doing a more exact analysis, we do this with linear search.  Then we discuss Big-Oh, some common complexity classes, and more!

Time Stamps:
0:00 Machine Independence?  
2:38 Model of Computation
6:03 RAM model
17:25 Exact Analysis (Linear Search)
29:48 Comparing Algorithms
34:34 Definition of Big-Oh
38:09 Common Usages of Big-Oh
47:33 Complexity Classes
52:31 Charting two functions to determine Big-Oh

Want the notes, and/or want to support my mission? Look no further, get the written companion to this video lectures series.  Buy the book, Advanced Data Structures: An Introduction to Data Structures and Algorithms, it is available at the below links (by format, given in parentheses):
 -Amazon (Paperback & Kindle): http://mybook.to/advanceddatastructures
 -Patreon & Subscribestar (Personally-signed PDF copy, support my work at the General Support Level):  Patreon: PageWizard  https://www.subscribestar.com/drpage

#Computation
#Algorithms
#CompSci

• #education
• #big_oh
• #computer_science
• #stfx
• #algorithms
• #data_structures
• #models_of_computation
• #ram
• #complexity