Explain divide and conquer algorithms

 Divide  and  conquer  is  probably  the  best  known  general  algorithm  design  method.  It   work according to the following general plan

i)  A problem's instance is separated into several smaller instances of the similar problem, ideally of about the same size.

ii) The smaller instances are solved

iii) If essential, the solutions obtained for the smaller instances are combined to get a solution to the original problem

 

Posted Date: 7/27/2013 5:35:40 AM | Location : United States

Ask an Expert

Related Discussions:- Explain divide and conquer algorithms, Assignment Help, Ask Question on Explain divide and conquer algorithms, Get Answer, Expert's Help, Explain divide and conquer algorithms Discussions

Write discussion on Explain divide and conquer algorithms
Your posts are moderated

Write your message here..

Related Questions

Sparse matrix, How sparse matrix stored in the memory of a computer? How sparse matrix stored in the memory of a computer?

Branch and bound algorithm, Suppose we have a set of N agents and a set of ... Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

Explain time complexity, Time Complexity, Big O notation The amount of ... Time Complexity, Big O notation The amount of time needed by an algorithm to run to its completion is referred as time complexity. The asymptotic running time of an algorithm i

Data structure- tree, Tree is dynamic data structures. Trees can expand & c... Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.

Multidimensional array, Q. The system allocates the memory for any of the m... Q. The system allocates the memory for any of the multidimensional array from a big single dimensional array. Describe two mapping schemes that help us to store the two dimensi

Array, extra key inserted at end of array is called extra key inserted at end of array is called

Data flow diagrams, How to construct a data flow diagram for a college assi... How to construct a data flow diagram for a college assignment and marking systemA

Ways to implement abstract data types, Ways to implement abstract data type... Ways to implement abstract data types A large part of the study of data structures and algorithms is learning about alternative ways to implement an ADT and evaluating alternat

Abstract data type-tree, Definition: A set of data values & related operati... Definition: A set of data values & related operations that are accurately specified independent of any particular implementation. As the data values and operations are described

Write an algorithm outputs number of books using psuedocode, A shop sells b... A shop sells books, maps and magazines. Every item is identified by a unique 4 - digit code. All books have a code starting with a 1, all maps have a code which starts with a 2 and