Recursive method to replace all occurrences of a value in a 2D array

I have created a recursive method that replaces all occurrences of an element in a two dimensional double array. The issue is that I cannot seem to get this working without encountering a stack overflow error. Could someone please look at my code below and show me how to fix this? I have tried setting this up several times over the past few days. Thank you. Note that my arrays are 2 x 3, so the first if means that if you are at column 1 row 2, you are at the end of the array, and in that case you are done searching.

private static int replaceAll(double number, double replacementTerm) {
    int i = 0;
    int j = 0;
    double searchFor = number;
    double replace = replacementTerm;

    if (i == 1 && j == 2) {
        System.out.println("Search complete!");
    }

    if (twoDimArray2[i][j] == searchFor) {
        System.out.println("Replaced An Element!");
        twoDimArray2[i][j] = replace;
        System.out.println(twoDimArray2[i][j]);
        j++;
        return replaceAll(searchFor, replace);
    }

    if (j == twoDimArray2.length) {
        i++;
        return replaceAll(searchFor, replace);
    } else {
        j++;
        return replaceAll(searchFor, replace);
    }
}

i and j should be method parameters instead of local variables so changes to their values can be tracked. Try to move right and down recursively if it does not exceed the bounds of the array. Note that this is much less efficient that iteration with two layers of for loops, as it will check multiple positions in the array more than once; to mitigate this, one can use a visited array to store all positions previous visited so they will not be checked again. See the below code in action here.

private static void replaceAll(double number, double replacementTerm, int i, int j) {
    double searchFor = number;
    double replace = replacementTerm;
    if (twoDimArray2[i][j] == searchFor) {
        System.out.println("Replaced An Element!");
        twoDimArray2[i][j] = replace;
        System.out.println(twoDimArray2[i][j]);
    }
    if (i == twoDimArray2.length - 1 && j == twoDimArray2[0].length - 1) {
        System.out.println("Reached the end!");
        return;
    }
    if (i + 1 < twoDimArray2.length) {
        replaceAll(number, replacementTerm, i + 1, j);
    }
    if (j + 1 < twoDimArray2[0].length) {
        replaceAll(number, replacementTerm, i, j + 1);
    }
}