Two dim array

Question

hello
it would be really nice if someone could help me with that.
i am trying to sort an array and i have read that i can do that with a statement called sort(), but it doesn't seem to work.
this is what i have tried:
for(int i = 0; i < arr.length; i++)
       for(int j = 0; j < arr.length; j++)
           sort(arr[i][j]);
}the error i get is:
Exercise5W2.java [56:1] No method found matching sort(int)
sort(arr[i][j]);
^
1 error
thanks for ur help!

Answer 1

You can use the java.util.Arrays.sort() with and without
the java.util.Comparator interface.
First you sort all individual one-dim int arrays,
then you sort the whole two-dim array.
Here is how it goes:
// 2-dim int array example
int[][] twoDimIntArray = { { 4, 67, 45 }, { 23, 98, 3}, { 2, 68, 112}, { 333, 5, 21 } };
// First you sort all individual 1-dim int arrays
for (int i = 0; i < twoDimIntArray.length; i++)
    Arrays.sort(twoDimIntArray);
// Then you sort the whole 2-dim array (with an house made Comparator)
Arrays.sort((Object[])twoDimIntArray, new TwoDimIntArrayComparator());
// Print out the result
for (int i = 0; i < twoDimIntArray.length; i++)
for (int j = 0; j < twoDimIntArray[i].length; j++)
System.out.print(twoDimIntArray[i][j] + " ");
System.out.println();
// Here is the Compararor for 2-dim int array objects
class TwoDimIntArrayComparator implements Comparator
public int compare(Object o1, Object o2)
int[] oneDimIntArray1 = (int[])o1;
int[] oneDimIntArray2 = (int[])o2;
// First integer of each array to be different,
// return the comparison
for (int i = 0; i < oneDimIntArray1.length; i++)
if (oneDimIntArray1[i] > oneDimIntArray2[i])
return 1;
else if (oneDimIntArray1[i] < oneDimIntArray2[i])
return -1;
// All integers of the arrays are equal
return 0;
public boolean equals(Object obj)
return false;