This lecture focus to presentation on Design and Analysis of Computer Algorithm. This lecture major focus on Greedy Algorithm. An algorithm which always takes Simplest immediate, or local, solution though getting a answer. Greedy algorithms will probably always find for the overall, or globally, optimal solution for some optimization problems, but will acquire less-than-optimal solution pertaining to some instances of different problems. Here briefly analysis example of Greedy Method and element of the Greedy Strategy. Finally discuss on Knapsack Problem and PseudoCode with example and solution.