Saturday, January 29, 2022

First Index

Base Case

public class FirstIndex {
public static void main(String[] args) {
int[] arr = new int[]{0, 1, 2, 3, 4, 5};
int num = 2;
int ans = firstIndex(arr, num, 0);
System.out.println(ans);
}

private static int firstIndex(int[] arr, int ele, int idx) {
// base case
if (idx == arr.length)
return -1;

if (arr[idx] == ele) {
return idx;
}
// faith
int val = firstIndex(arr, ele, idx + 1);

return val;
}
}

No comments:

Post a Comment

Diagonal Traversal

 eg.  1       2       3       4 5      6       7       8 9    10    11     12 13  14   15    16 Output: 1 6 11 16 2 7 12 3 8 4  Approach:...