如题
package 进程同步; import java.util.Arrays; public class Jinchengtongbu { public static void main(String[] args) { // TODO Auto-generated method stub String name[]={" 进程序号", " 读写者", " ", "开始时间"," 运行时间"}; for(int i=0;i<name.length;i++){ System.out.print(name[i]); } System.out.println(); String arr[][]= {{"1","r","3" ,"5"}, {"2","w","5","5"},{"3","r","4","2"},{"4","w","20","1"}}; int j,i; for(j=0;j<arr.length;j++){ for(i=0;i<arr[j].length;i++){ System.out.print( " "+ arr[j][i]); } System.out.println(); } int a = Integer.parseInt(arr[0][2]);//从0开始最好 int b = Integer.parseInt(arr[1][2]); int c = Integer.parseInt(arr[2][2]); int d = Integer.parseInt(arr[3][2]); int sort[]={a,b,c,d}; // Arrays.sort(sort); for(int g=0;g<sort.length;g++){ //测试输出是否正确 System.out.print(sort[g]); } System.out.println(); for(int k=0;k<sort.length;k++){//通过排序替换位置的思想可以完成二维数组依据某一列排序 for(int o=k+1;o<sort.length;o++){ if(sort[o]<sort[k]){ String f= arr[k][2]; String s= arr[k][0]; String m= arr[k][1]; String n= arr[k][3]; int su = sort[o]; arr[k][2]=arr[o][2]; arr[k][0]=arr[o][0]; arr[k][1]=arr[o][1]; arr[k][3]=arr[o][3]; sort[o]=sort[k]; arr[o][2]= f; arr[o][0]= s; arr[o][1]= m; arr[o][3]= n; sort[k] = su; } } } for(int g=0;g<sort.length;g++){ //测试用来排序的一维数组的排序是否正确 System.out.print(sort[g]); } System.out.println(); for(j=0;j<arr.length;j++){ for(i=0;i<arr[j].length;i++){ System.out.print( " "+ arr[j][i]); } System.out.println(); } } }