3 docs tagged with "divide-and-conquer"

Divide and conquer breaks a problem into independent subproblems of the same kind, solves those

Mergesort splits the array in half, sorts each half recursively, and merges the two sorted halves

Quicksort picks an element as the pivot, rearranges the array so that everything smaller sits to