CS50x Week 3 covers some of the most interesting problems in the course — from a simple plurality election system to the Tideman ranked pairs voting algorithm, complete with cycle detection and a directed candidate graph. There is also a sorting algorithm analysis problem that puts Bubble Sort, Merge Sort, and Selection Sort side by side. Here is how all four problems came together and what they teach you about algorithms and data structures in C.