Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

changed name course2 #928

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
+8 −3
Open

changed name course2 #928

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 8 additions & 3 deletions Course2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.