CST 370 Algorithms - Week 7

 This week's algorithms are another beautiful example of "speed is not everything" for algorithms I have mentioned couple times before. Of course, comparing to other algorithms, they are not the fastest. However, the way those algorithms execute, and layout visually is simply magnificent.

First and foremost are Counting Sort and Radix Sort. At the beginning of both algorithms, I was confused how can counting the Frequency in Counting Sort and the Radix Sort doesn't compare numbers, but they both can sort the list of numbers. In the end, it felt like I just watched a magic show. I totally understand how those algorithms function, but it's still amazed me how they do it. I think I will implement them, whenever available, over the Bubble Sort and those I learned.

Next, we have Warshall algorithm and Floyd algorithm. They both used for calculating the connection and direction of directed graphs. Similarly, I was confused at the beginning but at how those two actually work, especially via the numbers. Then, I realized Warshall is mean to travel from A to C via B. In other word, it checks to see if there is an available route from point A to point C through many different options. Similarly, I understood that Floyd algorithm calculated the shortest path with ease, which can be extremely useful in mathematics and programming. After that moment, I started thinking of how I can imply the Floyd algorithm (or similar concept) into my personal project, especially with the AI's pathfinding.

If I must pick the material that I enjoy the most in CST 370, I definitely pick this week, week 7.