Skip to content

Algo/Recursion #4

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
Aman0509 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Algo/Recursion #4

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9504e02
add leetcode problem
Aman0509 Jan 19, 2025
032d018
add YT links about recursive algo TC calculations
Aman0509 Jan 21, 2025
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
1 change: 1 addition & 0 deletions Algorithms/Recursion/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -133,3 +133,4 @@ To learn more about Recursion, follow below links:
14. [Stringify numbers](Problems/stringify_numbers.py)
15. [Collect strings](Problems/collect_strings.py)
16. [Total handshakes](Problems/total_handshakes.py)
17. [Leetcode: Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/description/)
10 changes: 10 additions & 0 deletions Introduction/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -250,3 +250,13 @@ Readings:
- [Big O: How to Calculate Time and Space Complexity](https://www.inoutcode.com/concepts/big-o/)
- [Space Complexity and Time Complexity](https://www.i2tutorials.com/design-and-analysis-of-algorithmsdaa-tutorial/daa-space-complexity-and-time-complexity/)
- [Big O notation - Data Structures & Algorithms Tutorial #2 | Measuring time complexity](https://www.youtube.com/watch?v=IR_S8BC8KI0&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=2)
- [Recurrence Relation (T(n)= T(n-1) + 1) #1](https://www.youtube.com/watch?v=4V30R3I1vLI)
- [Recurrence Relation (T(n)= T(n-1) + n) #2](https://www.youtube.com/watch?v=IawM82BQ4II&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=20)
- [Recurrence Relation (T(n)= T(n-1) + log n) #3](https://www.youtube.com/watch?v=MhT7XmxhaCE&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=21)
- [Recurrence Relation T(n)=2 T(n-1)+1 #4](https://www.youtube.com/watch?v=JvcqtZk2mng&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=23)
- [Masters Theorem Decreasing Function](https://www.youtube.com/watch?v=CyknhZbfMqc)
- [Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1](https://www.youtube.com/watch?v=8gt0D0IqU5w)
- [Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2](https://www.youtube.com/watch?v=XcZw01FuH18&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=25)
- [Recurrence Relation [ T(n)= 2T(n/2) +n] #3](https://www.youtube.com/watch?v=1K9ebQJosvo)
- [Masters Theorem in Algorithms for Dividing Function #1](https://www.youtube.com/watch?v=OynWkEj0S-s)
- [Root function (Recurrence Relation)](https://www.youtube.com/watch?v=9rVuyjxzwgM&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O&index=29)