Searching a 2D array for a range of values in java

your code should be look like this

for(int i = 0; i < array.length; i++){
    for(int j; j < array[i].length; j++){
        if(array[i][j] > 0){
           do some thing
         }
     }
}

You're using a nested for loop, right? And, I'm guessing, you have a something like a function which returns the found element? So you need a function which returns the found element and its coordinates - or just the coordinates, if the array is available outside of this function.

Something like this (pseudocode):

for i from 0 to max X
    for j from 0 to max Y
        if array[i][j] > 0
            return (array[i][j], i, j) # A tuple, or whatever -
                                       # just some data structure for
                                       # storing multiple things

As I understand your question, you have the following case: Given an integer k between 0, N (representing the position of an element in a single dim. array) find the coordinates of the corresponding cell in 2-d array, i.e find x(i,j) where x has R rows and C columns.

Example (rows R=3 and Columns C=4)

0 1 2  3 
4 5 6  7
8 9 10 11

Given k=6  Then i=1, j=2
Given k=11 Then i=2, j=3

Given k, you can find i, j as follows:

i=Int(k/c) //Row number (0-based)

j=k%c // Column number - (0-based) obtained by the remainder of dividing k by c