L26A 00:00 Pseudo code of merge sort 08:45 Complexity of merge sort L26B 00:00 Complexity of merge sort (cont. ) 13:30 Shortest-path problem 16:40 Example 22:00 Principle of optimality