Stuck with array's NEED HELP!!!

Question

I have been working at this for two hours now and I need a someone else's opinion other than my own. I need to create a method that finds the row index of the row which contains the largest number divisible evenly by 6. and the column index of the column with the smallest sum. all in one method.
This is what I have so far.
  public static int sum(int[][]arr, int numRow)
              int[][] s;
              s = new int[0][10];
              int u = 0, largestevenindex = 0, largesteven = -99999, product = 0, sum = 0, i, j;
              for(i=0;i<numRow;i++)
                for(j=0;j<arr.length;j++)
if(arr[i][j]%6==0 && arr[i][j]>largesteven) //To find the the row index of the largest number divisible by 6.
          largesteven = arr[i][j];
          largestevenindex = i;
     System.out.println(largesteven);
     System.out.println(largestevenindex);
     for(u=0;u<arr[i].length;u++) //I think I have to create another table and place the sums of the colums and then compare. Is there an easier way?
s[0] = s[0][u]+arr[i][j];
     System.out.println(s[0][u]);
return largestevenindex;
This is the test file23 45 10 77 19 13 16
52 34 71 19 88 65 3
12 1 57 16 4 36 17
9 22 31 27 8 25 12
56 77 88 22 33 44 99
6 21 16 89 4 37 48
25 17 8 9 64 72 81
95 26 5 73 18 92 66
99 12 45 72 19 77 43
11 71 26 34 81 7 45
16 2 34 68 67 7 51
19 52 4 56 51 95 12
57 4 7 9 2 1 3
Anyone have any tips for my code, or another way to do this. Thanks.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

Answer 1

Your right flounder, I forget to add we are suppose to just find the product of the two index(smallest sum cloum index and largest row index divisible by 6)
         public static int sum(int[][]arr, int numRow)
              int[][] s;
              s = new int[0][10];
              int u = 0, largestevenindex = 0, largesteven = -99999, product = 0, sum = 0, i, j;
              for(i=0;i<numRow;i++)
                for(j=0;j<arr.length;j++)
if(arr[i][j]%6==0 && arr[i][j]>largesteven)
          largesteven = arr[i][j];
          largestevenindex = i;      
return largestevenindex;
This gets the row index of the highest number divisible by 6. How do I go about finding the colum index that has the smallest sum. any hints or clues. It has to be apart of this method, though.