JAVA
java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
package main.com.igee;
import java.util.Scanner;
public class {
public void sortMatrix(int[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return;
// TODO Write your code inside
// -------------------------------------------
for (int i=0; i<matrix.length;i++) {
for (int j=0; j<matrix[0].length; j++) {
int [] index = {i,j};
for (int k =i; k<matrix.length; k++) {
for (int p=0; p<matrix[0].length; p++) {
if (p<j && k==i)break;
else {
if (matrix[k][p]<matrix[index[0]][index[1]]) {
index[0]=k;
index [1]=p;
}}
}
}
int tmp = matrix[i][j];
matrix [i][j] = matrix [index [0]][index[1]];
matrix [index [0]][index[1]] = tmp;
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run