cst 370: week 7

This week, we learned about non-comparison sorting and dynamic programming.

Non-comparison sorting includes counting sort and radix sort, which sort numbers without comparing them directly. counting sort works by counting how many times each value appears and placing them in order, which is fast for integers within a known range. radix sort sorts numbers digit by digit using a stable sort like counting sort at each step, making it efficient for large datasets.

Finally, we also learned about dynamic programming, which breaks problems into smaller overlapping parts and stores past results to save time. examples like the coin-collecting and coin-row problems showed how it helps find optimal solutions more efficiently.

This week, I also am prepping for the final exam. The material is cumulative, so I need to make sure I prep from the mid-term concepts, as well as the final exam concepts.