Skip to content

Add information to Course2 for module Divide-and-Conquer Algorithms. #932

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

Open
PrathikshaAmin wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add information to Course2 for module Divide-and-Conquer Algorithms. #932

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
7 changes: 4 additions & 3 deletions Course2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@ 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.
My name is Prathiksha S
Divide and Conquer Algorithms
It is a problem-solving technique where a complex problem is broken down into smaller, more manageable subproblems.
Firstly the main problem is divided into smaller, more manageable subproblems. This step continues until the subproblems become simple enough to solve directly. Then the solutions to the subproblems are found. This is often done recursively, where each subproblem is further divided until it reaches a base case that can be solved straightforwardly. Finally, the solutions to the subproblems are combined to solve the original problem. This step is crucial for ensuring that the solutions to the subproblems work together to provide an optimal solution to the main problem.