Divide-and-conquer algorithms

Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly on larger distributions.

worst-case optimal stable divide and conquer comparison sorting algorithm

mathematical game or puzzle

algorithm design paradigm based on multi-branched recursion

first subcubic matrix multiplication algorithm

algorithm for integer multiplication

the problem of finding the two points with minimum distance from a larger finite set of points

fast Fourier Transform algorithm