Answer:
1. Karatsuba algorithm for fast multiplication it does multiplication of two n-digit numbers in at most.
2. Merge Sort is also a sorting algorithm. The algorithm divides the array in two halves, recursively sorts them and finally merges the two sorted halves.
3. Cooley–Tukey Fast Fourier Transform (FFT) algorithm is the most common algorithm for FFT. It is a divide and conquer algorithm which works in O(nlogn) time.
Explanation:
3 examples that follows divide and conquer approach.
