Divide and conquer algorithm

Bellman equation
Divide and conquer algorithm
Greedy algorithm
Markov Decision Process
Stochastic programming ...

This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size n = n1n2 into many smaller DFTs of sizes n1 and n2, along with O(n) multiplications by complex roots of unity traditionally called twiddle factors.