Week 49 (1/5/2026 - 1/13/2026)
(Click on READ MORE for better formatting)
Hi everyone, welcome to my 49th blog! This is the Week 1 post for CST 370 Design and Analysis of Algorithms.- Weekly learning journal relevant to this week's module. (50 words)
- This week was primarily review for me. The focus on this week really came down to an basic introduction as to what algorithms are, some important problem types, fundamental data structures (such as stack, queue, graph, tree, linked lists, etc), the analysis framework, and finally a shared topic between this week and next week on asymptotic notation.
- There was also a homework assignment this week that tasked me to write a program that can determine if a given string is a palindrome. There was a "palindrome puzzle" in the course material that gave me a great place to start on coding this.
- Finally, I also contributed this article to our course's official Discord server:
https://medium.com/@csunfolds/what-is-the-best-case-average-case-and-worst-case-time-complexity-analysis-4188e5448863. It outlines the notation of each case efficiency (worst, avg, best) and also gives examples on how certain algorithms are classified with each notation.
That is all for this week, see you in my Week 50 post!
Halfway through the CS Online program next week!
Comments
Post a Comment