Divide, Conquer and Combine paradigm

Table of Contents
  1. Divide: Divide the n-element sequence to be sorted into two subsequences of n/2 elements each
  2. Conquer: Sort the two subsequences recursively using merge sort
  3. Combine: Merge the two sorted subsequences to produce the sorted answer.

Tags

Merge Sort