Program to find the minimum element in an array by recursion

Program to find the minimum element in an array by recursion

Given an array , write a Program to find the minimum element in an array by recursion.

Sample input:-

a[]={3,4,1,43,5,11};

Sample output:-

minimum element in the array is 1

Program to find the minimum element in an array by recursion:-

The objective of this code is to find the minimum element in the array by recursion . So for this purpose we traverse the array from the end to the starting . And the base case for it will be if n==1 (length of array ) then we have  to return a[0] (first element of the array) otherwise return minimum of  the last element and value return by the recursive function FindMinimum() . 

C Code:-

#include<stdio.h>

// function for calculate minimum between 
// two element
int min(int a,int b)
{
    return a>b?b:a;
}

// Recursive function for finding the minimum element
int FindMinimum(int a[],int n)
{
    if(n==1)
     return a[0];
    return min(a[n-1],FindMinimum(a,n-1));
}
int main()
{
    int a[]={3,4,1,43,5,11};
    int n=sizeof(a)/sizeof(a[0]) ;
    printf("minimum element in the array is %d",FindMinimum(a,n));
    return 0;
}

Output:-

minimum element in the array is 1

 

Recommended post:-