Algorithms: Sorting Insertion Sort O(n) best case, O(n^2) worst case. Used generally for small sorted lists Merge Sort O(n log(n)) Scales well to large lists Quicksort O(n log(n)) best case, O(n^2) worst case. Requires complex implementations to avoid worst case. Bubble Sort O(n^2) Simple, but inefficient