From ab7d6a49028bbdc8999c63e2d9a8fae3f7b851a7 Mon Sep 17 00:00:00 2001 From: Opt231 Date: Sun, 5 Nov 2023 19:40:54 +0530 Subject: [PATCH] changed name course2 --- Course2 | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-) diff --git a/Course2 b/Course2 index c86029b..64be352 100644 --- a/Course2 +++ b/Course2 @@ -7,6 +7,11 @@ You can choose onemodule from the list below:- 5)Dynamic Programming -Pawan Dubey -Dynamic Programming -Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems. +OM PRAKASH TIWARI +Greedy Algorithm +In the "Greedy Algorithm" module, I gained a deep understanding of a fundamental algorithmic +strategy used in problem-solving. Greedy algorithms aim to make locally optimal choices at each step in the +hope of finding a globally optimal solution. I learned how to identify problems that are suitable for greedy algorithms, +such as scheduling and minimum spanning trees. The key insight is to select the best possible choice at each +stage without worrying about the global picture, which can lead to efficient solutions for a wide range of problems. +This module helped me appreciate the elegance and efficiency of greedy algorithms in algorithm design and problem-solving.