SU-CS161 Things to Review SU-CS161 Embedded Ethics Lectures Divide and Conquer SU-CS161 SEP232025 Sorting merge sort: SU-CS161 SEP252025 recurrence solving: SU-CS161 SEP302025 median: SU-CS161 OCT022025 randomized algos + quicksort: SU-CS161 OCT072025 linear time sorting: SU-CS161 OCT092025 Data Structures red-black trees: SU-CS161 OCT142025 hashing: SU-CS161 OCT212025 Graphs DFS/BFS: SU-CS161 OCT232025 Strongly connected components: SU-CS161 OCT282025 Dijikstra: SU-CS161 OCT302025 DP bellman-ford and Floyd-Warshall: SU-CS161 NOV112025 more DP LCS, knapsack, independent set: SU-CS161 NOV132025 Greedy Algorithms greedy algorithms: SU-CS161 NOV182025 MSTs: SU-CS161 NOV202025 Closing Max Flows, Min Cuts, and Ford-Fulkerson: SU-CS161 DEC022025