Sorting is arranging data in a specific order (usually ascending or descending). Common sorting techniques: Bubble Sort: Simple, compares adjacent elements Selection Sort: Selects smallest/largest element repeatedly Insertion Sort: Builds sorted array one item at a time Merge Sort: Divide-and-conquer, merges sorted subarrays Quick Sort: Divide-and-conquer using a pivot Heap Sort: Uses binary heap structure Counting Sort: For known, limited range of integers Radix Sort: Sorts by digits Bucket Sort: Distributes into buckets, then sorts each Each has different time/space complexities and use cases.