Both are divide‑and‑conquer sorts. QuickSort partitions around a pivot, is in‑place and very fast on average O(n log n), but has O(n²) worst‑case and is not stable. MergeSort splits and merges, is stable with guaranteed O(n log n) worst‑case, but needs O(n) extra memory and works well for linked lists/external sorting.