Explain divide and conquer algorithms, Data Structure & Algorithms

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







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
Related Questions
for i=1 to n if a[i}>7 for j=2 to n a[j]=a{j}+j for n=2 to n a[k]=a[j]+i else if a[1]>4 && a[1] for 2 to a[1] a[j]= a{j]+5 else for 2to n a[j]=a[j]+i ..


State  in brief about assertion Assertion: A statement which should be true at a designated point in a program.

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

A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a

Q. A Binary tree comprises 9 nodes. The preorder and inorder traversals of the tree yield the given sequence of nodes: Inorder :          E     A    C    K    F     H    D

You have to sort a list L having of a sorted list followed by a few "random" elements. Which sorting methods would be especially suitable for this type of task?   Insertion sort

In this assignment, you are invited to design and implement a software system for catalogue sale. A catalogue is organised in a tree structure. Each node of the catalogue tree repr

WRITE AN ALGORITHM TO READ TWO NUMBERS AND PRINT THE LOWER VALUE

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is called as a   Queue.