A greedy algorithm is an algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. Greedy algorithms mostly fail to find the globally optimal solution.
Example, greedy algorithm for the traveling salesman problem.
|225 Counting money || Write a program to count the money |
|226 Task scheduling problem || A job scheduler is a computer application for controlling unattended background program execution. |
|227 Huffman coding || Huffman coding is a lossless data compression algorithm and it drives based on the estimated frequency of occurrence for each possible value of the source symbol. |
|228 Selection problem || Write a program to selection problem |
|230 Selection sort || Selection sort is sorting algorithm that divide into sorted and unsorted part. It moves unsorted items to sorted array every step. |
|231 Prime Kruskal algorithm || Both Algorithms helps to find minimum-spanning-tree. Use Prims algorithm when a graph with lots of edges. Prim's algorithm is significantly faster in the limit when dense graph with many more edges than vertices. Kruskal performs better in sparse graphs and it uses simpler data structures. |
|233 Dijkstas algorithm || Dijkstras algorithm is an algorithm for finding the shortest paths between nodes in a graph. |