Week 50 (1/14/2026 - 1/20/2026) | Halfway Point!
(Click on READ MORE for better formatting)
Hi everyone, welcome to my 50th blog! This is the Week 2 post for CST 370 Design and Analysis of Algorithms.- Weekly learning journal relevant to this week's module. (50 words)
- Similarly to week 1, week 2 featured a considerable amount of review from my lower level DSA course in community college, since that class also had an emphasis on asymptotic notation. The focus on this week really came down to the three primary representations, which are:
- Worst = O (Big O)
- Avg = Θ (Big Theta)
- Best = Ω (Big Omega)
- As an example, here is how these notations come into play for a linear search in a one-dimensional array:
- Worst: O(n) — element is last or not found
- Avg: Θ(n) — element is somewhere in the middle
- Best: Ω(1) — element is the first in the list
- There was also a homework assignment this week that tasked me to write two programs:
- 1. Display the closest distance between two numbers among all input numbers
- 2. Display input numbers in ascending order, if there are consecutive numbers, use a shortened representation. For example, if there are three numbers such as 51, 52, and 53 in the input values, you have to display that as 51–53.
- Finally, I also contributed this video to our course's official Discord server:
https://www.youtube.com/watch?v=kPRA0W1kECg. This video has a visual (and auditory!) representation of fifteen different sorting algorithms. Fun fact: the first time I ever saw this video was when my AP Computer Science A teacher showed it to the class all the way back in high school, and I have come back to this video a couple of times since then!
That is all for this week, see you in my Week 51 post!
This week also officially marks the halfway point through the CS Online program!
Comments
Post a Comment