#include <stdio.h>
 
int RLinearSearch(int A[], int n, int key) {
    if(n<0) { // Base case - not found
        return -1;
    }
    if(A[n]==key) { // Base case - found
        return n;
    }
    // Recursive case
    return RLinearSearch(A, n-1, key);
}
 
int main(void) {
    int A[5]={23,41,22,15,32};   // Array Of 5 Elements 
 
    int pos = RLinearSearch(A, 4, 22);
 
    if(pos==-1)
        printf("Not found\n");
    else
        printf("Found at %d\n", pos);
	return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgUkxpbmVhclNlYXJjaChpbnQgQVtdLCBpbnQgbiwgaW50IGtleSkgewogICAgaWYobjwwKSB7IC8vIEJhc2UgY2FzZSAtIG5vdCBmb3VuZAogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGlmKEFbbl09PWtleSkgeyAvLyBCYXNlIGNhc2UgLSBmb3VuZAogICAgICAgIHJldHVybiBuOwogICAgfQogICAgLy8gUmVjdXJzaXZlIGNhc2UKICAgIHJldHVybiBSTGluZWFyU2VhcmNoKEEsIG4tMSwga2V5KTsKfQoKaW50IG1haW4odm9pZCkgewogICAgaW50IEFbNV09ezIzLDQxLDIyLDE1LDMyfTsgICAvLyBBcnJheSBPZiA1IEVsZW1lbnRzIAoKICAgIGludCBwb3MgPSBSTGluZWFyU2VhcmNoKEEsIDQsIDIyKTsKCiAgICBpZihwb3M9PS0xKQogICAgICAgIHByaW50ZigiTm90IGZvdW5kXG4iKTsKICAgIGVsc2UKICAgICAgICBwcmludGYoIkZvdW5kIGF0ICVkXG4iLCBwb3MpOwoJcmV0dXJuIDA7Cn0K