From 9504e0255b104c1dca4401d7176dc4c948b4c6d5 Mon Sep 17 00:00:00 2001 From: aman Date: Sun, 19 Jan 2025 13:35:53 +0530 Subject: [PATCH 1/2] add leetcode problem --- Algorithms/Recursion/README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/Algorithms/Recursion/README.md b/Algorithms/Recursion/README.md index bb889c5..b388527 100644 --- a/Algorithms/Recursion/README.md +++ b/Algorithms/Recursion/README.md @@ -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/) From 032d018ea98e9af8b2cc2e6ea844d8f6d5765645 Mon Sep 17 00:00:00 2001 From: aman Date: Tue, 21 Jan 2025 11:40:12 +0530 Subject: [PATCH 2/2] add YT links about recursive algo TC calculations --- Introduction/README.md | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/Introduction/README.md b/Introduction/README.md index d5838f0..c743196 100644 --- a/Introduction/README.md +++ b/Introduction/README.md @@ -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)