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

The various ways in which lc code can be accessed, Problem Your LC code... Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

Define ordinary variable, Ordinary variable An ordinary variable of a e... Ordinary variable An ordinary variable of a easy data type can store a one element only

State the range of operation of abstract data type, State the range of oper... State the range of operation of ADT Operations of the Range of T ADT includes following, where a, b ∈ T and r and s are values of Range of T: a...b-returns a range value (an

Illustrate the back face detection method, Illustrate the Back Face Detecti... Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Multiple stacks in a single array, implement multiple stacks in an array an... implement multiple stacks in an array and write different algorithms to perform operations on it

Calculate the k-th power and recursive algorithem, 1. The following is a r... 1. The following is a recursive algorithm to calculate the k -th power of 2. Input k a natural number Output kth power of 2 Algorithem: If k =0then return 1 Else return 2* po

Calculates partial sum of an integer, Now, consider a function that calcula... Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

Function performs multiplication of two numbers, You need to write a functi... You need to write a function that performs multiplication of two numbers in your data structure. Again, remember how you multiply numbers in base 10 and you should be fine. Multipl

Creation of a circular linked list, Program: Creation of a Circular linked ... Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

Explain the rgb model, RGB Model The RGB model is based on the assumpti... RGB Model The RGB model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red, green, and blue light. The exact hues