Computation & Algorithms II: Binary Search and Merge Sort

This lecture covers the concepts of binary search and merge sort algorithms. It starts by explaining binary search, its application in scenarios like inspecting exam results, and the recursive nature of the algorithm. The lecture then delves into merge sort, detailing the process of splitting a list, sorting each half, and merging them. It also discusses the idea of recursion in algorithms, using Fibonacci numbers as an example. The lecture concludes with an introduction to dynamic programming, focusing on the Floyd algorithm for finding the shortest path between multiple points in a graph.