My Journey Through Sorting Algorithms

Over the past few sessions, I got hands-on experience with different sorting algorithms, and honestly, it felt like slowly uncovering how computers actually think when organizing data. What started as simple concepts gradually turned into deeper insights about efficiency, memory usage, and problem-solving strategies. 📅 Day 07: Bubble Sort & Selection Sort This was my starting point with sorting algorithms, and it really helped me build a strong foundation. 🔹 Bubble Sort Bubble Sort works by repeatedly comparing adjacent elements and swapping them if they’re in the wrong order. At first, it felt very intuitive—almost like manually sorting numbers step by step, the way we might do it on paper. 💡 What I understood: Easy to implement and visualize Not efficient for large datasets (O(n²)) More useful for learning than real-world applications What stood out to me was how simple logic can still solve a problem, even if it’s not the most efficient way. 🔹 Selection Sort Selection Sort takes a s