🌀Java Recursion Programs

Adds up every element of an array by recursing one index at a time.

Checks whether a string is a palindrome by recursively narrowing the comparison window from both ends.

Computes n! using tail recursion, carrying the running product as an accumulator.

Computes n! using recursion.

Finds the largest element of an array by comparing it against the recursive maximum of the rest.

Finds the smallest element of an array by comparing it against the recursive minimum of the rest.

Finds the greatest common divisor of two numbers using a recursive function.

Prints every element of an array using recursive calls instead of a loop.

Prints every number from n down to 1 using a recursive function instead of a loop.

Prints every number from 1 up to n using a recursive function instead of a loop.

Prints every character of a string on its own line using recursion instead of a loop.

Reverses the digits of a number by carrying the result through recursive calls.

Adds up every number from 1 to n using a recursive function instead of a loop.

Generates the first n Fibonacci numbers recursively.

Computes the single Fibonacci number at a given position using plain recursion.

Prints every combination of a fixed size chosen from a small set of items.

Prints every possible ordering of a string's characters using backtracking.

Builds every subsequence of a string by branching into an include/exclude decision at each character.

Prints every possible subset of an array, including the empty set and the full set, using recursion.

Sorts an array by recursing once per bubble-sort pass instead of looping.

Sorts an array by recursively sorting everything before the last element, then inserting it.

Solves the classic Tower of Hanoi puzzle and prints every move.

Counts how many ways n queens can be placed on an n by n board with none attacking each other.

Finds a path from the top-left to the bottom-right of a grid, moving only through open cells.

Fills in a partially-completed 9 by 9 Sudoku grid using backtracking.