CST370 - Week 5 Reflection
Week 5 Learning Recap On the other side of our first midterm exam, I'm now attempting to absorb the material at a more demonstrable level. I was mindful of ensuring practical understanding before continuing my traversal of the week's offerings of Quick Sort, binary trees, Decrease & Conquer, Insertion Sort, Topological Sort, and Transform & Conquer--among other puzzles and detours. A sizeable gap in my exam performance revolved around analyzing time complexities for new algorithms and programs I hadn't encountered yet. This week's module offered moments to rectify that trouble right away by analyzing time costs calculations with the Quick Sort worst-case and best-case T(n) equations. Following along to Professor Jia's explanation of Quick Sort and w riting out the recursion tree by hand helped clarify why the linear work per level accumulates logarithmically--in the most favorable case at least. Bin...