In the second Prolog lecture, we posed the 3 practice problems from the textbook:
- Reverse the elements of a list
- Find the smallest element of a list
- Sort the elements of a list
While these are not problems particularly well-suited for Prolog, at least not in the same way as Sudoku and Queens are, they aim to help you understand how to using recursion with lists. This is one of the most important and most commonly used technique to help you describe and solve problems in Prolog.
We have posted our solutions to these three problems. Please take a look and feel free to post any questions on Github.
We will also briefly go over these solutions at the beginning of our next class.