I finished the first module of Tim Roughgarden’s Stanford/Coursera course “Divide and Conquer, Sorting and Searching, and Randomized Algorithms”. The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). I loved how it was language-agnostic. More mathematical proofs than I’d expected!