Week 7

 

Weekly Learning Journal: Week 7 Reflection

Technical Focus: Breaking the O mega(n log n) Barrier

This week’s module centered on a pivotal shift in algorithmic strategy: the transition from comparison-based sorting to Non-Comparison Sorting techniques like Counting Sort and Radix Sort.

In previous modules, we established that comparison-based algorithms (like Merge Sort or Quick Sort) are mathematically bounded by a lower limit of \Omega(n \log n)$. However, I learned that by making specific assumptions about the input data—such as the range of integers or the number of digits—we can achieve Linear Time Complexity O(n). While the time efficiency is superior, the trade-off lies in Space Complexity, as these algorithms require auxiliary arrays or "buckets" to track frequencies or digit distributions.

Strategic Transitions: Greedy vs. Dynamic Programming

Furthermore, we began exploring the Greedy Technique through Prim’s Algorithm for finding the Minimum Spanning Tree (MST). Comparing this to Dynamic Programming (DP) concepts like Floyd’s Algorithm or the Coin-Row Problem highlighted a crucial distinction: Greedy algorithms make the locally optimal choice at each step, whereas DP ensures a globally optimal solution by solving and storing results for overlapping subproblems. Understanding when a "Greedy" approach is sufficient versus when the overhead of DP is necessary is a critical skill I am currently refining through our Homework 6 implementation.

Comments

Post a Comment

Popular posts from this blog

Week 4

  Week 4 Learning Journal: Merge Sort, The Master Theorem, and Midterm Synthesis Technical Summary: Week 4 was a pivotal point in CST 370 as we transitioned from basic brute-force techniques to the Divide-and-Conquer paradigm. The primary focus was Merge Sort , a sophisticated sorting algorithm that employs a recursive strategy to achieve $O(n \log n)$ efficiency. The logic involves two distinct phases: the "Divide" phase, where the array is split into $n$ sub-lists (each containing one element), and the "Merge" phase, where those sub-lists are repeatedly merged to produce new sorted sub-lists until only one remains. A major highlight of this week was applying the Master Theorem to analyze algorithm efficiency. The Master Theorem provides a mechanical way to solve recurrence relations of the form T(n) = aT(n/b) + f(n) . For Merge Sort, the relation is T(n) = 2T(n/2) + \Theta(n) . Since the work done at each level of the recursion ( f(n) ) matches the cost of the...
Read more

Week 2

Weekly Learning Journal: Algorithm Analysis & Recursion This week, my study focused on the Algorithm Analysis Framework , specifically the formal application of asymptotic notations ( $O$ , $\Omega$ , and $\Theta$ ). While I previously had a surface-level understanding of Big-O, this module challenged me to define the tight bounds of an algorithm's efficiency using Big-Theta. I learned that while Big-O provides a worst-case "ceiling," Big-Theta is often more useful for describing the actual growth rate of non-recursive loops, such as those found in standard sorting or searching algorithms. A significant portion of my time was dedicated to the analysis of recursive algorithms . This was a step up in complexity from non-recursive analysis because it requires setting up a recurrence relation . I practiced the backward substitution method , which involves expanding the recursive calls until a pattern emerges that can be expressed as a summation. For example, seeing how a...
Read more

Week 1

  Week 1 Learning Journal Entry Module: Introduction to Algorithms and Fundamental Data Structures Date: January 13, 2026 This week, I focused on the formal definition of algorithms and the various ways to measure their efficiency. I studied Euclid’s algorithm for finding the Greatest Common Divisor (GCD) and compared it to the consecutive integer checking algorithm, noting how algorithm choice significantly impacts performance. I also reviewed fundamental data structures, specifically focusing on graph representations (adjacency matrices vs. adjacency lists) and how they differ for weighted and unweighted graphs. Implementing the Palindrome puzzle was a great exercise in string manipulation; it taught me how to effectively use the two-pointer technique and the importance of data preprocessing, such as filtering non-alphanumeric characters and normalizing case to ensure logical correctness. Finally, the "Fake Coin" and "Mislabeled Baskets" puzzles served as a s...
Read more