Phase 3 - Level 2: Advanced Recursion
Master advanced recursive patterns - digit operations, GCD, binary conversion.
10 programs · open one, then the next
Start with Count Digits Recursively- 01Count Digits RecursivelyIntermediateCount digits in a number using recursion.Open example →pydef count_digits(n): # Base case if n == 0: return 0
- 02Reverse Number RecursivelyIntermediateReverse a number recursively.Open example →pydef reverse_number(n, rev=0): # Base case if n == 0: return rev
- 03Check Palindrome RecursivelyIntermediateCheck if a number is palindrome recursively.Open example →pydef reverse_number(n, rev=0): if n == 0: return rev last_digit = n % 10
- 04Product of Digits RecursivelyIntermediateCalculate product of digits recursively.Open example →pydef product_digits(n): # Base case if n == 0: return 1
- 05GCD RecursivelyIntermediateFind GCD using Euclidean algorithm recursively.Open example →pydef gcd(a, b): # Base case if b == 0: return a
- 06Convert Number to Binary RecursivelyIntermediateConvert decimal number to binary recursively.Open example →pydef to_binary(n): # Base case if n == 0: return ""
- 07Print Digits in WordsIntermediatePrint digits of a number in words recursively.Open example →pydef print_digit_word(digit): words = ["Zero", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"] return words[digit]
- 08Sum of First N Even Numbers RecursivelyIntermediateCalculate sum of first n even numbers recursively.Open example →pydef sum_even(n): # Base case if n == 0: return 0
- 09Sum of First N Odd Numbers RecursivelyIntermediateCalculate sum of first n odd numbers recursively.Open example →pydef sum_odd(n): # Base case if n == 0: return 0
- 10nCr Recursively (Pascal Formula)AdvancedCalculate nCr using Pascal triangle formula recursively.Open example →pydef ncr(n, r): # Base cases if r == 0 or r == n: return 1