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 algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

In this unit, we have learned how the stacks are implemented using arrays and using liked list. Also, the advantages and disadvantages of using these two schemes were discussed. Fo

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

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program


How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Q. Explain the technique to calculate the address of an element in an array. A  25 × 4  matrix array DATA is stored in memory in 'row-major order'. If base  address is 200 and

The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)