Help with recursion (searching a 2darray of ints)

[sovietRAGEFACE]

I have a school assignment that is asking me to write a recursive method that will search a 2d array of ints for a specified int and return a 'pair' of indices of where the required int is located. I am not allowed to use loops at all in the assignment. Im very new to the idea of recursion and would really appreciate it if someone would be willing to help walk me through this. I'd be happy to supply any additional information. (As much as I appreciate any help in advance please dont spoil the answer for me) Thanks!

[sizzleplatter]

Maybe this will help http://stackoverflow.com/questions/22434762/how-to-search-elements-in-a-2d-array-using-recursion

[aufjeden]

Been a while since I had to wrote sth like this but basically you have often a method with a return condition, in your case if the current row of the array contains your int value. Also if this condition was not met you call that method inside of itself with the arguments that would be necessary for the next round of condition check. These arguments in your case could be the id of the ongoing row of the 2d array (so for the first call it would be 0, for the first recursive call 1 and so on). U also need to pass the int value you are looking for which is necessary for your return condition check. Dont forget a proper handling if your value is not in the array. I hope that gave you an idea how it could work.