Question: Need help converting the following to recursive -- function takes in a 2d array and should return total element that are * example of the
Need help converting the following to recursive -- function takes in a 2d array and should return total element that are *
example of the array grid:
0 1 2 3 4 5 6 7 8 9 0 * * * * * * * * * * 1 * * * * * * * * * * 2 * * # # # # # * * * 3 * * # * * * # * * * 4 * * # # * * # * * * 5 * * * # # * # * * * 6 * * * * # # * * * * 7 * * * * * * * * * * 8 * * * * * * * * * * 9 * * * * * * * * * *
current function:
int contaminationChecker(char grid[WALL_SIZE][WALL_SIZE]){ int contaminatedArea = 0;
for (int i = 0; i < WALL_SIZE; i++){ for (int j = 0; j < WALL_SIZE; j++){ if (grid[i][j] == '*')
contaminatedArea++;
}
}
return contaminatedArea;
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
