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 “think” when organizing data. What started as simple concepts turned into deeper insights about efficiency, memory, and problem-solving. 📅 Day 07: Bubble Sort & Selection Sort This was my starting point with sorting algorithms, and it 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. 💡 What I understood: Easy to implement and visualize Not efficient for large datasets (O(n²)) Good for learning, not for real-world use 🔹 Selection Sort Selection Sort takes a slightly different approach. It finds the smallest element and places it in the correct position. 💡 My takeaway: Fewer swaps compared to Bubble Sort Still not very efficient (O(n²)) Helped