Notes/Lecture_Notes
1
0
Fork 0
mirror of https://github.com/dholerobin/Lecture_Notes.git synced 2025-07-01 13:06:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix code indentation - tabs to spaces.

Browse Source
This commit is contained in:
Pragy Agarwal 2019-10-10 16:27:21 +05:30 committed by GitHub
parent 0d31843dcf
commit 6cb7d76454
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
Recursion.md
View File

@ -1,4 +1,4 @@
Recursion Recursion
---------- ----------
Recursion - process of function calling itself Recursion - process of function calling itself
directly or indirectly. directly or indirectly.
@ -41,11 +41,11 @@ _Optimised solution:_
def pow(n, k): def pow(n, k):
if k == 0: return 1 if k == 0: return 1
nk = pow(n, k//2) nk = pow(n, k//2)
if k % 2 == 0: if k % 2 == 0:
return nk * nk return nk * nk
else: else:
return nk * nk * n return nk * nk * n
``` ```
Why not f(n, k/2) * f(n, k/2+1) in the else condition? Why not f(n, k/2) * f(n, k/2+1) in the else condition?
@ -103,7 +103,7 @@ Going right = 1
Basically, for each element, choose = 1, skip = 0 Basically, for each element, choose = 1, skip = 0
So, generate numbers from 0 to $2^n-1$ and look at the bits of the numbers. Each subset is formed using each number. So, generate numbers from 0 to $2^n-1$ and look at the bits of the numbers. Each subset is formed using each number.
```python ```
For A = [1 2 3] For A = [1 2 3]
000 [] 000 []
@ -175,9 +175,9 @@ The subsetSum problem can be divided into two subproblems.
def subsetSum(A,N,cur_sum, i, target): def subsetSum(A,N,cur_sum, i, target):
if i == N: if i == N:
if cur_sum == target: if cur_sum == target:
return 1 return 1
else : else :
return 0 return 0
take = subsetSum(A,N,cur_sum + A[i], i+1, target) take = subsetSum(A,N,cur_sum + A[i], i+1, target)
no_take = subsetSum(A,N,cur_sum, i+1, target) no_take = subsetSum(A,N,cur_sum, i+1, target)
return take + no_take return take + no_take
@ -203,11 +203,11 @@ The subsetSum2 problem can be divided into two subproblems.
def subsetSum2(A,N,cur_sum, i, target): def subsetSum2(A,N,cur_sum, i, target):
if i == N: if i == N:
if cur_sum == target: if cur_sum == target:
return 1 return 1
else : else :
return 0 return 0
elif cur_sum > target: elif cur_sum > target:
return 0; return 0;
take = subsetSum2(A,N,cur_sum + A[i], i, target) take = subsetSum2(A,N,cur_sum + A[i], i, target)
no_take = subsetSum2(A,N,cur_sum, i+1, target) no_take = subsetSum2(A,N,cur_sum, i+1, target)
return take + no_take return take + no_take