Skip to content

Add Ankit Kumar changes in course 1 #1814

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
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add Ankit Kumar changes in course 1 #1814

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
8 changes: 3 additions & 5 deletions Course1
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,9 +4,7 @@ You can choose one module from the list below:-
2)Divide and Conquer Algorithms
3)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.

Ankit Kumar
2 Divide and Conquer Algorithms
Divide and conquer is a classic algorithmic strategy that breaks a complex problem into smaller, similar subproblems, solves each one recursively, and then combines the results to obtain the final solution. This approach simplifies challenging tasks and often improves efficiency. Well known examples include merge sort, quick sort, and binary search. It is also used in advanced algorithms like the fast Fourier transform and closest pair of points. By reducing the size of problems at each step, divide and conquer often achieves better time complexity, such as O(n log n), though it may require extra memory for recursion and merging.