CST370 - Week 7

This week we learned about some very interesting algorithms and problems. First, we learned about counting sort and radix sort. These are both examples of non-comparison-based sorting that can be implemented to improve efficiency. The professor provided a very cool and informative visualization of the radix sort to help teach us the method.

(See below - https://www.cs.usfca.edu/~galles/visualization/RadixSort.html )

Next, we were introduced to dynamic programming with the coin collecting problem and coin row problem. They were both very interesting and cool to learn how to solve. Then we looked at two famous algorithms: Warshall's Algorithm and Floyd's Algorithm. Warshall's calculates the transitive closure of a directed graph, while Floyd's presents all pairs' shortest paths in a weighted digraph. The last thing we learned about was the greedy technique including MST and Prim's Algorithm.

We had two programming assignments this week. The first was to conduct the radix sort and the second was to implement the coin-collecting problem with the limitations of inaccessible cells. I was able to complete both homework programs and gave them in on time.