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
Draw a B-tree of order 3 for the following sequence of keys: 2,4,9,8,7,6,3,1,5,10.and delete 8 and 10

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

data structure for multiqueue

Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

#include #include int sumFact(int numb); int calculateFactorial(int digit); main() { int numb, sumfact; do{ printf ("Enter a number 1 to 9999\n"); scanf("%

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

Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text

how to write a code for for a company , for calculate the salary pay

Post-order Traversal This can be done both iteratively and recursively. The iterative solution would need a change of the in-order traversal algorithm.

Program segment for All pairs shortest paths algorithm AllPairsShortestPaths(int N, Matrix C, Matrix P, Matrix D) { int i, j, k if i = j then C[i][j] = 0  for ( i =