Recursion

The process in which a function calls itself directly or indirectly is called recursion.

Name		Name	Last commit message	Last commit date
Latest commit History 37 Commits
All Indices of Number		All Indices of Number
Binary Search (Recursive)		Binary Search (Recursive)
Calculate Power		Calculate Power
Check AB		Check AB
Check Number in Array		Check Number in Array
Check Palindrome (recursive)		Check Palindrome (recursive)
Count Zeros		Count Zeros
First Index of Number		First Index of Number
Geometric Sum		Geometric Sum
Last Index of Number		Last Index of Number
Merge Sort Code		Merge Sort Code
Multiplication (Recursive)		Multiplication (Recursive)
Number of Digits		Number of Digits
Pair Star		Pair Star
Print Keypad Combinations Code		Print Keypad Combinations Code
Print Numbers		Print Numbers
Print Permutations		Print Permutations
Print Subset Sum to K		Print Subset Sum to K
Print Subsets of Array		Print Subsets of Array
Print all Codes - String		Print all Codes - String
Quick Sort Code		Quick Sort Code
README.md		README.md
Remove Duplicates Recursively		Remove Duplicates Recursively
Remove X		Remove X
Remove X ( other approach)		Remove X ( other approach)
Replace Character Recursively		Replace Character Recursively
Replace pi (recursive)		Replace pi (recursive)
Return Keypad Code		Return Keypad Code
Return Permutations - String		Return Permutations - String
Return all codes - String		Return all codes - String
Return subset of an array		Return subset of an array
Return subsets sum to K		Return subsets sum to K
Staircase		Staircase
String to Integer		String to Integer
Sum of Array		Sum of Array
Sum of digits (recursive)		Sum of digits (recursive)
Tower of Hanoi		Tower of Hanoi

Provide feedback