Algorithm - Divide-and-Conquer algorithm design paradigm

Sorting Quicksort Anim


You take a problem, and break it down into smaller sub problems which you then solve recursively and then you somehow combine the results of the smaller sub-problem to get a solution to the original problem that you actually care about.

Merge Sort is the most transparent application of the Divide-and-Conquer paradigm.

Documentation / Reference

Discover More
Merge Sort
Ordinal Data - Merge sort Algorithm

John von Neumann invented merge sort in 1945. It requires O(n log n) comparisons. A sorting algorithm for rearranging lists (or any other data structure that can only be accessed sequentially, e.g. file...

Share this page:
Follow us:
Task Runner