Loading....
Coupon Accepted Successfully!

 

Divide And Conquer

 

In its simplest form, a divide-and-conquer algorithm divides the problem instance into a number of subinstances, recursively solves each subsistences parately, and then combines the solutions to the subinstances to obtain the solution to the original problem instance.





Test Your Skills Now!
Take a Quiz now
Reviewer Name