CA 17 - Different Sorting Methods

Introduction Sorting is one of the most fundamental concepts in programming. It helps organize data in a specific order (ascending or descending), making it easier to search, analyze, and process. In this blog, I will explain four important sorting algorithms: Bubble Sort Insertion Sort Selection Sort Merge Sort Bubble Sort Idea Bubble Sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. How it Works Compare two adjacent elements Swap if needed Repeat this for the entire array After each pass, the largest element moves to the end Code (Python) a = [ 5 , 3 , 8 , 4 ] n = len ( a ) for i in range ( n ): for j in range ( 0 , n - i - 1 ): if a [ j ] > a [ j + 1 ]: a [ j ], a [ j + 1 ] = a [ j + 1 ], a [ j ] print ( a ) Use When: You are learning sorting basics → Helps understand comparisons, swaps, and iteration Dataset is extremely small (like < 10 elements) → Overhead of complex algorithms is unnecessary You need to detect if an array is already sorted