C++ program to find Last occurrence of a Number using Recursion in an array

Algorithm:

Step 1: To solve this using recursion, make a recursion function with inputs, and a variable currIndex to traverse the input array.

Step2: Base Case:- If currIndex == size of the input array, return -1, i.e element not found.

Step3: Take input of next recursion call ,withcurrIndex incremented by 1 , in a variable ‘index’.

Step 4:
If(index == -1 && input[currIndex] == x)
Return currIndex
Else
Return index;

C++ Source Code/Function:

#include<bits/stdc++.h>

using namespace std;

int lastIndex(int input[], int size, int x, int currIndex){
    if(currIndex== size){
        return -1;
    }

    int index = lastIndex(input,size,x,currIndex+1);
    
    if(index == -1 && input[currIndex] == x){
        return currIndex;
    }
    else{
        return index;
    }
}

int main(){
    int input[] = {9,8,10,8};
    int x = 8;
    int size = 4;
    cout<<lastIndex(input,size,x,0);

    return 0;
}

Output

3