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
Define Wire-frame Model This skeletal view is called a Wire-frame Model. Although not a realistic representation  of the object, it is still very useful in the early stages of

what is far and near procedures in system programming?

Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang

conversion of centrigral to frahenhit

The assignment aims at consolidating your knowledge on data mining techniques and developing practical skills through solving a problem of transcription factor binding sites recogn

GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EXAMPLE.

Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj


Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord