Question

How to find the smallest number in an array of numbers using recursion in C

Answer 1

#include <stdio.h>
 
int find_smallest_recursion(int arr[], int i, int smallest) {
    if (i == 0) {
        return smallest;
    }
    if (i > 0) {
        if (arr[i] < smallest) {
            smallest = arr[i];
        }
        return find_smallest_recursion(arr, i - 1, smallest);
    }
}
 
int main(void) {
    int arr[] = { 7, 90, 20, 10, 8, 89, 4, 70, 55, 84 };
 
    int size = sizeof(arr) / sizeof(int);
 
    int smallest = arr[0];
 
    smallest = find_smallest_recursion(arr, size - 1, smallest);
 
    printf("Smallest = %d\n", smallest);
 
    return 0;
}


 
 
/*
run:
 
Smallest = 4
 
*/

 

70+ SQL courses for beginners and professionals