greedy.pptVIP

Algorithm Design Techniques:Greedy Algorithms Introduction Algorithm Design Techniques Design of algorithms Algorithms commonly used to solve problems Greedy, Divide and Conquer, Dynamic Programming, Randomized, Backtracking General approach Examples Time and space complexity (where appropriate) Greedy Algorithms Choose the best option during each phase Dijkstra, Prim, Kruskal Making change Choose largest bill at each round Does this always work? Bad examples where greedy does not work? Greedy Algorithms Must have Greedy-choice property: a globally optimal solution can be arrived at by maki