Greedy techniques can be used as an approximation algorithm for complex problems

Job scheduling algorithm

Disjoint sets-UNION by size and UNION by height (or rank)

Fractional Knapsack problem

Coin change problem

Shortest path in Weighted Graph [Dijkstra’s]

Prim’s and Kruskal’s algorithms

Huffman coding compression algorithm

Priority Queues: Heap sort

Sorting: Selection sort, Topological sort