Divide-and-Conquer
Divide-and-Conquer. General idea: Divide a problem into subprograms of the same kind; solve subprograms using the same approach, and combine partial solution (if necessary). List List 1 List 2 n elements n/2 elements n/2 elements. min, max min1, max1 min2, max2.
1.12k views • 46 slides