# recursion

All articles that involve recursion.

## C Program to find the power of a number without using pow() function

Write a C program to find the power of a number without using pow() function. Find power of number using loop Suppose you need to find . The simplest way is to use a loop and multiply times. Steps Let the input be . X is the base and Y is the exponent. Initialize power …

## Merge Two Sorted Arrays using Recursion

Merge Two Sorted Arrays into one sorted array using Recursion. Merging sorted arrays using recursion is similar to merging using a loop.

## Recursive Binary Search Algorithm Pseudocode

Recursive Binary Search Algorithm Pseudocode in both Ascending order and descending order. Pseudo code for recursive binary search algorithm.

## C Program to Add 2 Matrices

Write a C Program to add 2 Matrices. Write Programs for the addition of 2 matrices, one using recursion (recursively) and one using loops.

## C Program to Print Pascal’s Triangle

Write a C/C++ Program to Print Pascal’s Triangle. It can be implemented using 1D Array, 2D Array, Jagged Array and recursion.

## Reverse an Array in c/c++

Write a Program to Reverse an Array in c/c++. It can be done 2 ways, using Recursion (recursively) and without using recursion (iteratively).

## Reverse a Linked List in Group of Given size

Reverse the given Linked List is Group of given size K using recursion (recursively) and without recursion (iteratively).

Linked List can be reversed both recursively and iteratively. Reverse a Linked List using recursion. Reverse a Linked List using iteration.

## Ternary Search

Ternary search is a searching algorithm that searches an element in a sorted array. Algorithm Ternary search works similar to Binary search. The only difference is instead of dividing the array into 2 parts, the array is divided into three parts and 2 parts are rejected on each iteration. That is, the array is reduced …

## Binary Search

Binary search is algorithm that searches an element in a sorted array in O(logN) complexity. It can be implemented using recursion or without recursion.