Summary

Sorting organizes data into order. Know common sorting_algorithms: bubble_sort, selection_sort, insertion_sort, merge_sort, quick_sort, heap_sort, counting_sort, radix_sort. Remember typical time_complexity: O(n^2) for bubble, selection, insertion. O(n log n) for merge, quick average, heap. O(n + k) for counting and radix. Note stable_sort examples: insertion, merge, counting, radix. Stability preserves equal order. Common in_place sorts: insertion, quick, heap. The in_place property uses O(1) extra space_complexity.