# Lab 04
# Q1: Skip Add
if n <= 0:
return 0
return n + skip_add(n - 2)
1
2
3
2
3
# Q2: Summation
if (n == 1):
return term(1)
return term(n) + summation(n - 1,term)
1
2
3
2
3
# Q3: GCD
return gcd(b, a%b) if b > 0 else a
1
# Tree Recursion
# Q4: Insect Combinatorics
if (m <= 0 and n <= 0):
return 0
if (m == 1 and n == 1):
return 1
return paths(m-1,n) + paths(m,n-1)
1
2
3
4
5
2
3
4
5
# Q5: Maximum Subsequence
if n == 0 or l == 0:
return 0
a = 10 * max_subseq(n//10,l-1) + (n%10)
b = max_subseq(n//10, l)
return max(a,b)
1
2
3
4
5
2
3
4
5