An Online Experience

 Hey everyone, This week’s learning journey took me through several important algorithmic techniques and problem-solving strategies, expanding both my theoretical knowledge and my practical skills. I began with Non-Comparison Sorting , where I explored Counting Sort and Radix Sort . Unlike traditional comparison-based methods like Merge Sort or Quick Sort, these algorithms leverage properties of the input data to achieve better-than- O(n log n) performance in certain cases. Counting Sort uses frequency counting to sort integers efficiently, while Radix Sort applies a digit-by-digit sorting approach (often using Counting Sort as a subroutine), making it especially useful for fixed-length integers or strings. The visualizations helped me understand how these algorithms maintain stability and avoid element comparisons altogether. Next, I dove into Dynamic Programming (DP) . The key takeaway was that DP is all about solving complex problems by breaking them into overlapping subproble...

 Hey everyone, This week, I explored several fundamental data structures and algorithms that are essential for efficient data organization and manipulation. I started with AVL Trees , where I learned how self-balancing binary search trees maintain their height through rotations. From the lecture and exercises, I practiced identifying whether a tree is AVL and performed left and right rotations to restore balance. The AVL tree visualization tool was especially helpful in understanding how the tree structure changes dynamically during insertions. Additionally, I shared about my experience in comparing test cases in our homework assignments with my classmates on Discord. I shared how to add the "a.out" file and use the manual commands provided by the professor. I also studied 2-3 Trees , a type of balanced search tree where nodes can contain two or three children. I learned how values are inserted and how nodes split when they become overfull. The video introduction and exercise...