In this module, we will continue our study of general recursion, especially in the presence of invariants. We will apply general recursion and invariants to better understand classic linear search, and depth-first and breadth-first searching in a graphs. Last, we apply our knowledge to the classic problem of placing 8 queens on a chessboard.
Finally, we give a midterm review that summarizes the takeaway points from the first half of the course.
Part V from the textbook.
Problem Set 08
Last modified: Sat Nov 8 17:06:00 Eastern Standard Time 2014