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
What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

what is circular doubly link list?write down the algorithm for insertion of elements in circular doubly link list

Explain about Franklin Algorithm We mentioned how the number of possible comparisons of polygons grows as the square of the number of polygons in the scene. Many of the hidden-

Link list representation of a circular queue is more efficient as it employs space more competently, of course with the added cost of storing the pointers. Program 7 gives the link

Simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations and the effect of introducing nu

Document processing is quickly becoming one of the dominant functions of computers. Computers are utilized to edit, search & transport documents over the Internet, and to display d

A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

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.


The ?-Notation (Lower Bound) This notation provides a lower bound for a function to within a constant factor. We write f(n) = ?(g(n)), if there are positive constants n 0 and