Software Lessons Session 22: Complexity Theory, Big-O Notation, P=NP

Written By Ron Picard

Software Lessons Session 22: Complexity Theory, Big-O Notation, P=NP

-Overview of Complexity Theory
-Big-O notation
-Complexity Classes
-P=NP (Polynomial Time vs Non-deterministic Polynomial Time)

Ron Picard
Previous

Software Lessons Session 23: Programming in C++: Data Structures and Sorting Algorithm Examples
Next

Software Lessons Session 21: Programming in C++: Data Structures Part 2