*Lesson 8: Algorithms (new cut) *
Welcome back and thanks for the feedback that the explanations of the merging in merge sort was mnisleading! I made a new video cut with hopefully a clearer set.
The rest of the lesson specifies a way to identify the theoretical and efficiency and practical performance of algorithms. A general classification uses the "Big-O" notation. Samples with sorting algorithms are demonstrated, which also leads to the use of recursion and backtracking. Finally, some techniques are explained to measure the runtime efficiency of real Matlab programs.
*Timestamps:*
00:04:50 - What is an algorithm
00:10:35 - Efficiency and performance
00:18:20 - "Big-O" notation
00:42:06 - Bubble sort algorithm
00:47:21 - Merge sort algorithm
00:55:51 - Recursion
01:08:36 - Finding pathes through a graph ("The house of Santa Claus")
01:22:31 - Real-world performance measurements
