Write a recursive function that finds and returns the minimum element in an arra

Question

Write a recursive function that finds and returns the minimum element in an array, where the array and its size are given as parameters Function prototype: Int findmin(int a[], int n); // return min element in a[] C++ Write a recursive function that finds and returns the minimum element in an array, where the array and its size are given as parameters Function prototype: Int findmin(int a[], int n); // return min element in a[] C++ Function prototype: Int findmin(int a[], int n); // return min element in a[] C++

Explanation / Answer

Please find the below code for finding minimum element through recursion:

i

int minbyrecursion(int a[],int n)

{

                int minval;

                if(n==1)

                return a[0];

//this case is basically to counter if the array has only one element in it else it goes inot the recursion mode of finding the element

                else

                {

                                min= minbyrecursion (a,n-1);

                                                //send the array one size less everytime so as to reach the last element of the array

//As we know that recursion follows a top down or bottom up approach here we are following a top down approach

                                if(min<a[n-1])

                                {

                                return min;

                                }

                                else

                                return a[n-1];

                }

}

thanks a lot for teh question . do let me know if you have queries

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.