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
I need to know about data structure and algorithms. can you help me?

Explain Division Method Division Method: - In this method, key K to be mapped into single of the m states in the hash table is divided by m and the remainder of this division

Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Q. Illustrate the result of running BFS and DFS on the directed graph given below using vertex 3 as source.  Show the status of the data structure used at each and every stage.

B i n a ry Search Algorithm is given as follows 1. if (low > high) 2.     return (-1) 3. mid = (low +high)/2; 4. if ( X = = a [mid]) 5.      return (mid); 6.

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Q. Write down an algorithm for finding a key from a sorted list using the binary search technique or method.

Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13          30          62           73         81         88             91

Write down any four applications of the queues.                                                            Ans. A pp li cation of Queue is given below (i)  Queue is