Explain about greedy technique, Data Structure & Algorithms

Explain about greedy technique

The  greedy  method  suggests  constructing  a   solution  to  an  optimization  problem   by  a sequence of steps, every expanding a partially constructed solution obtained so far, unless a  complete solution to the problem is reached. On every step, the choice made must be feasible, locally optimal and irrevocable.

 

Posted Date: 7/27/2013 5:46:42 AM | Location : United States







Related Discussions:- Explain about greedy technique, Assignment Help, Ask Question on Explain about greedy technique, Get Answer, Expert's Help, Explain about greedy technique Discussions

Write discussion on Explain about greedy technique
Your posts are moderated
Related Questions
Q. What do you understand by the term sparse matrix? How sparse matrix is stored in the memory of a computer? Write down the function to find out the transpose of a sparse matrix u

#questionalgorithm for implementing multiple\e queues in a single dimensional array

Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

If a node having two children is deleted from a binary tree, it is replaced by?? Inorder successor


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


In the last subsection, we have implemented a stack by using an array. While a stack is implemented by using arrays, it suffers from the basic restriction of an array - i.e., its s

Q. Draw  the structures of complete  undirected  graphs  on  one,  two,  three,  four  and  five vertices also prove that the number of edges in an n vertex complete graph is n(n-1