Lecture "Data structures and algorithms: Chapter 2 - Complexity of algorithms" provide students with knowledge about: Algorithm Efficiency; Big-O notation; Problems and common complexities; P and NP Problems. Please refer to the detailed content of the lecture! |