CST370: Journal Entry Week 7

This week the concepts we covered were Counting Sort, Radix Sort (A version of Counting Sort), Dynamic Programming, Warshall’s Algorithm, Floyd-Warshall’s Algorithm, Greedy Technique, and Prim’s Algorithm. It sounds like a lot when you list them out like that. I think the thing I had the most trouble grasping was how the intermediary arrays were calculated in Counting Sort, but I figured it out in the end. It was just a little unclear in the lecture. Hw6_1 was more difficult than hw6_2 because of the complexity; probably because only hw6_2 had a nice hint with the pseudocode and hw6_1 didn’t. I have to keep preparing for the final that’s in 4 days. One of the next class orientations is only an hour after the end of the window to complete the final. Week 8 is super barebones and the only assignment is the final so that’s basically it for this class. I think I’m going to miss this class. There’s definitely a lot more to learn about algorithms.

Comments

Popular posts from this blog

CST438: Journal Entry Week 1

CST370: Journal Entry Week 3

CST311: Journal Entry Week 7