My Learning Experience with Sorting Algorithms

During my journey in Data Structures and Algorithms, I explored different sorting techniques and understood how they work under the hood. Sorting is one of the fundamental concepts in programming, and learning it helped me improve my problem-solving skills.

In this blog, I’ll share my understanding of various sorting algorithms and what I learned from them.
Basic Sorting Algorithms

I started with simple sorting methods that are easy to understand but not very efficient for large inputs.

1. Bubble Sort: This algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order.
2. Easy to implement
3. Not efficient for large datasets

4. Time Complexity: O(n²)

5. Selection Sort:
   In this method, the smallest element is selected and placed in the correct position during each iteration.

6. Simple logic

7. Performs fewer swaps than bubble sort

8. Time Complexity: O(n²)

9. Insertion Sort:
   This algorithm builds the sorted array step by step by inserting elements into their correct position.

10. Efficient for small or nearly sorted arrays

11. Time Complexity: O(n²)
    Efficient Sorting Algorithms

After understanding the basics, I moved on to more optimized algorithms that perform better with large datasets.

1. Merge Sort: Merge sort follows the divide and conquer approach.
2. Splits the array into halves
3. Sorts each half recursively
4. Merges them back together
5. Time Complexity: O(n log n)

6. Stable and reliable

7. Quick Sort:
   Quick sort also uses divide and conquer but works differently by selecting a pivot element.

8. Partitions the array around the pivot

9. Recursively sorts subarrays

10. Time Complexity: O(n log n) (average case)

11. Very fast in practice

What I Learned:
Through this learning process, I understood that:

• Different sorting algorithms have different strengths
• Some are simple but slow, while others are complex but efficient
• Choosing the right algorithm depends on the situation

Conclusion:

• Learning sorting algorithms helped me understand how optimization works in programming. Starting with simple approaches and gradually moving to advanced ones made the learning process smoother.
• Sorting is not just about arranging elements — it builds a strong foundation for solving many real-world problems.