divide and conquer

1 article · All tags

• Merge Sort
  A stable O(n log n) divide-and-conquer sorting algorithm that recursively splits an array and merges sorted halves.