public static int Find(int[] arr, int Si, int data) {
int ans = -1;
if (arr[Si] == data) {
return Si;
} else if (Si <= arr.length - 2) {
ans = Find(arr, Si + 1, data);
}
return ans;
}Is this correct too? It is different from the video , that's why I am asking
@brahatsingh32 Yup bro its correct its just the same thing, draw recursion tree of the code.
And mark this doubt as resolved.