Implement QuickSort (O(n log n) avg), MergeSort (O(n log n) guaranteed), and understand when to use each. QuickSort is in-place; MergeSort is stable.

• QuickSort (O(n log n) avg)
• MergeSort (O(n log n) guaranteed)
• Understand when to use each

function quickSort(arr, low = 0, high = arr.length - 1) {
  if (low < high) {
    const pi = partition(arr, low, high);
    quickSort(arr, low, pi - 1);
    quickSort(arr, pi + 1, high);
  }
// ...

• QuickSort works

• QuickSort: pick pivot, partition, recursively sort halves
• MergeSort: divide in half, sort each half, merge; always O(n log n)
• Use QuickSort for average case; MergeSort when you need guaranteed O(n log n)

Implement QuickSort (O(n log n) avg), MergeSort (O(n log n) guaranteed), and understand when to use each. QuickSort is in-place; MergeSort is stable.

• QuickSort (O(n log n) avg)
• MergeSort (O(n log n) guaranteed)
• Understand when to use each

function quickSort(arr, low = 0, high = arr.length - 1) {
  if (low < high) {
    const pi = partition(arr, low, high);
    quickSort(arr, low, pi - 1);
    quickSort(arr, pi + 1, high);
  }
// ...

• QuickSort works

• QuickSort: pick pivot, partition, recursively sort halves
• MergeSort: divide in half, sort each half, merge; always O(n log n)
• Use QuickSort for average case; MergeSort when you need guaranteed O(n log n)