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

Explain the term group support system, (a) Explain the term Group Support S... (a) Explain the term Group Support System and elaborate on how it can improve groupwork. (b) Briefly explain three advantages of simulation. (c) Explain with the help of a

If else, design algorithm and flow chart that computes the absolute differe... design algorithm and flow chart that computes the absolute difference of two values x and y

Tree traversal, Q. What do you understand by the tree traversal? Write down... Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

Tree traversals, There are three kinds of tree traversals, namely, Postorde... There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Write down the procedure to reverse a singly linked list. , Ans: A pr... Ans: A procedure to reverse the singly linked list: reverse(struct node **st) { struct node *p, *q, *r; p = *st; q = NULL; while(p != NULL) { r =q;

Illustrate an example of algorithm, Illustrate an example of algorithm ... Illustrate an example of algorithm Consider that an algorithm is a sequence of steps, not a program. You might use the same algorithm in different programs, or express same alg

Graphs, In this unit, we will describe a data structure called Graph. Actua... In this unit, we will describe a data structure called Graph. Actually, graph is a general tree along no parent-child relationship. In computer science, Graphs have several applica

Linked list implementation of a queue, The fundamental element of linked li... The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .

The search trees are abstract data types, the above title please send give ... the above title please send give for the pdf file and word file

Determine the output of vehicles algorithm, Draw trace table and determine ... Draw trace table and determine the output from the below flowchart using following data (NOTE: input of the word "end" stops program and outputs results of survey):  Vehicle = c