Divide
and Conquer technique: Divide and conquer is a top-down technique for designing
algorithms that consists of dividing the problem into smaller sub problems hoping
that the solution of the sub problems are easier to find and then composing the
partial solutions into the solution of the original problem.
10 March 2018

What is divide and conquer technique
You May Also Like
- Algorithm Design
What is the use of Dijkstra’s algorithmApr 06, 2018
- Algorithm Design
- Algorithm Design
- Algorithm Design
How does Divide and Conquer method workApr 01, 2018
Newer Article
Write down the difference between greedy method and dynamic programming
Older Article
What do you mean by feasible solution and optimal solution
Labels:
Algorithm Design
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment