slarysort.java

Java 程序设计源码 只提供了部分

public class SlarySort {
	public static void main(String[] args) {
		int[][] list = {
				{4,5,4,4,4},
				{4,5,5,4,4},
				{4,5,4,3,4},
				{4,5,4,6,4},
				{4,5,4,7,4},
				{4,5,4,8,4},
				{4,5,4,9,4}
					};
		int[][] slarys = new int[7][2];
		
		//Before sorting
		for(int i = 0; i < list.length; i++) {
			for(int j = 0; j < list[i].length; j++) {
				System.out.print(list[i][j] + " ");
			}
			System.out.println();
		}

		for(int i = 0; i < list.length; i++) {
			int slary = 0;

			for(int j = 0; j < list[i].length; j++) {
				slary += list[i][j];
			}
			slarys[i][0] = i;
			slarys[i][1] = slary;
		}

		for(int i = 0; i < slarys.length; i++) {
			for(int j = 0; j < slarys[i].length; j++) {
				System.out.print(slarys[i][j] + " ");
			}
			System.out.println();
		}

		quickSort2(slarys,0,list.length,slarys.length,slarys[0].length);

		System.out.println();

		//After Sorting
		for(int i = 0; i < list.length; i++) {
			for(int j = 0; j < list[i].length; j++) {
				System.out.print(list[i][j] + " ");
			}
			System.out.println();
		}
				
	}


	static void quickSort2(int[][] items,int left,int right,int row,int colnum) {
		int i,j;
		int x;	
		int[] y = new int[colnum];
		int[][] slary = new int[row][colnum]; 

		i = left;
		j = right;
		
		x = items[(left + right) / 2][colnum - 1];

		do {
			while(items[i][colnum - 1] < x) i++;
			while(x < items[j][colnum - 1]) j--; 
		
			if(i <= j) {
				for(int k = colnum - 1; k >= 0; k--) {
					y[k] = items[i][k];
					items[i][k] = items[j][k];
					items[j][k] = y[k];
				}

				i++;
				j--;
			}
		}while(i <= j);

		if(j > left) quickSort2(items,left,j,row,colnum);
		if(i < right) quickSort2(items,i,right,row,colnum);
	}

	/**static void quickSort(int[] items,int left,int right) {
		int i,j;
		int x,y;

		i = left;
		j = right;
		
		x = items[(left + right) / 2];

		do {
			while(items[i] < x) i++;
			while(x < items[j]) j--; 
		
			if(i <= j) {
				y = items[i];
				items[i] = items[j];
				items[j] = y;
				i++;
				j--;
			}
		}while(i <= j);

		if(j > left) quickSort(items,left,j);
		if(i < right) quickSort(items,i,right);
	}
	*/

}