EXTRA: Merge Sort

Merge Sort is a classic divide-and-conquer algorithm. It works by dividing the array into smaller parts, sorting each part, and then merging them back together. General idea: Divide the array into halves. Recursively sort each half. Merge the sorted halves.

Apr 28, 2025 - 14:13
 0
EXTRA: Merge Sort

Merge Sort is a classic divide-and-conquer algorithm.

It works by dividing the array into smaller parts, sorting each part, and then merging them back together.

General idea:

  1. Divide the array into halves.
  2. Recursively sort each half.
  3. Merge the sorted halves.