Divide and conqur

  28 Apr 2019

By Wen Xu

algorithm tech

Divide and conqur is a very powerful scheme that can reduce the original problem into sub-problems, which can be recursively reduced to sub-sub-problems and solved.

The solved sub-problems can be combined to obtain the result for the orignal problem.

comments powered by Disqus