Divide and Conquer

We can make a sorting routine using merge. Divide and conquer is a technique for solving a large problem by breaking it into two smaller problems, until the problems become easy. If we cut the problem in half each time, the solution will be O(log(n)) or O(n · log(n)).

Contents    Page-10    Prev    Next    Page+10    Index