Comparing insertion, merge and quick sort

Describe how insertion sort, merge sort and quicksort work and compare their time and space complexity.

Insertion sort is $O(n^2)$, merge sort $O(n\log n)$ always, quicksort $O(n\log n)$ on average. Insertion sort inserts each element into the sorted prefix: $O(n)$ when nearly sorted, in place. Merge sort splits in half, sorts each and merges: guaranteed and stable but needs $O(n)$ extra memory. Quicksort partitions around a pivot and recurses: fast in practice and in place, but $O(n^2)$ with bad pivots.