Week 6: Inference Rules & Sorting Strategies

This week, I learned the rules of introducing logical structures; they were fairly understandable because I already knew how to structure a proof based on the structure of the claim. If it is a implication, assume the antecedent and prove the consequent. I had no problems understanding these rules. For the rest of the lecture, Professor Heap introduced sorting strategies and it began with two common algorithms: Insertion sort and selection sort, one of which is very familiar because I use it for several card games. I may need to review the worst case for a program because I am unclear as to how the worst case scenario is generated for an insertion sort. Overall, the lecture was fun and refreshing.