cst370-week 2- learning -journal
This week’s module focused on analyzing algorithm efficiency using asymptotic notation and understanding basic problem-solving strategies such as brute force. I learned how to identify a basic operation in an algorithm and count how many times it executes in order to determine time complexity. The examples on finding a maximum value and checking uniqueness helped clarify how to analyze both best-case and worst-case scenarios, especially when nested loops are involved. I also learned how brute force approaches like sequential search and selection sort prioritize simplicity over efficiency, often resulting in higher time complexity. This helped me understand why brute force is usually a starting point that can later be improved with more efficient algorithms.
Comments
Post a Comment