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 two famous methods for traversing, The two famous methods for traversin... The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

Insertion sort, It is a naturally occurring sorting method exemplified thro... It is a naturally occurring sorting method exemplified through a card player arranging the cards dealt to him. He picks up the cards like they are dealt & added them into the neede

Explain about hubs, Hubs - In reality a multiport repeater - Connect... Hubs - In reality a multiport repeater - Connects stations in a physical star topology - As well may create multiple levels of hierarchy to remove length limitation of 10

Darw a flowchart to input 3 numbers, This algorithm inputs 3 numbers, every... This algorithm inputs 3 numbers, every number goes through successive division by 10 until its value is less than 1. An output is produced which comprise the number input and a val

Abstract data type-list, It is a useful tool for indicating the logical pro... It is a useful tool for indicating the logical properties of data type. It is a collection of values & a set of operations on those values. Methodically, "a TYPE is a set, & elemen

Arrays, This unit discussed about data structure called Arrays. The easiest... This unit discussed about data structure called Arrays. The easiest form of array is a one-dimensional array which may be described as a finite ordered set of homogeneous elements

Illustrate the operations of the symbol abstract data type, The operations ... The operations of the Symbol ADT The operations of the Symbol ADT are the following. a==b-returns true if and only if symbols a and bare identical. a symbol bin Unico

Number of leaf nodes in a complete binary tree, The number of leaf nodes in... The number of leaf nodes in a complete binary tree of depth d is    2 d

Explain linked list and its types, Data Structure and Algorithm 1. Exp... Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Insertion into a red-black tree, The insertion procedure in a red-black tre... The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c