Sorting Algorithms

Sorting Algorithms A sorting algorithm is a way to arrange elements of an array in a specific order, usually ascending or descending. It helps in organizing data so that other operations like searching and processing become easier and faster. Sorting algorithms may look similar at first, but each one follows a different idea. Understanding how they work with small examples makes them easier to grasp. Merge Sort Merge Sort divides the array into smaller parts and then merges them back in sorted order. It keeps splitting the array until each part has one element. Then it starts merging them step by step in a sorted way. Example: [4, 2, 1, 3] Split → [4, 2] and [1, 3] Split again → [4] [2] [1] [3] Merge → [2, 4] and [1, 3] Final merge → [1, 2, 3, 4] Key Points: Uses divide and conquer Always O(n log n) Uses extra space for merging Quick Sort Quick Sort picks a pivot and places it in the correct position. Then it rearranges the array so that smaller elements are on the left and larger ones