CSUMB

CST370 - Learning Journal 7

Author

Date Published

CSUMB logo 2

This week we learned simply way too many algorithms. They are as follows:

1. Counting Sort

2. Radix Sort

3. Coin Collecting problem

4. Warshall's Algorithm

5. Floyd's algorithm

6. Prim's algorithm

On top of that we learned about logical strategies like Dynamic Programming and reinforced the Greedy technique.

It's great to know about all these potential solutions but, I fear that the crux of the problem is in the application. Figuring out the best algorithm for a given problem seems to be where the real value lies and something that AIs tend to struggle with. At least a little.

Personally, I find it difficult to think about practical use cases for some of these outside of machine learning or practices that are heavy on graphs. I'm just out here trying to program user interfaces and move data from point A to point B.


Comments

Join the conversation! Login to reply to comments