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
Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each comp

How To implement stack using two queues , analyze the running time of the stack operations ?

If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

important points on asymptotic notation to remember

What do you understand by term structured programming? Explain the structured programming as well.                                 Ans. S tructured Programming is expla

The time required to delete a node x from a doubly linked list having n nodes is O (1)

what are grounded header linked lists?


Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

how to write a pseudo code using Kramer''s rule