Java——快速排序和冒泡排序

package javagaoji;

//冒泡排序
public class BubbleSort {
	
	public static void bubbleSort(int[] data){
		int s;
		
		for (int i = 0; i < data.length-1; i++) {
			
			for (int j = 0; j < data.length-1-i; j++) {
				
				if(data[j] > data[j+1]){
					s = data[j+1];
					data[j+1] = data[j];
					data[j] = s;
				}
			}
		}
	}
	
	public static void main(String[] args) {
		int[] data = {9,16,21,23,30,49,25,66};
		System.out.println("排序之前：\n" + java.util.Arrays.toString(data));
		bubbleSort(data);
		System.out.println("排序之后：\n" + java.util.Arrays.toString(data));
	}

}

package javagaoji;

//快速排序
public class QuickSort {
	
	public void quickSort(String[] strDate,int left,int right){
		String middle,tempDate;
		int i,j;
		i=left;
		j=right;
		middle=strDate[(i+j)/2];
		
		do{
			while(strDate[i].compareTo(middle)<0&& i<right)
			i++; //找出左边比中间值大的数
		
			while(strDate[j].compareTo(middle)>0&& j>left)
			j--; //找出右边比中间值小的数
		
			if(i<=j){ //将左边大的数和右边小的数进行替换 
				tempDate=strDate[i];
				strDate[i]=strDate[j];
				strDate[j]=tempDate;
				i++;
				j--;
			}
		}while(i<=j); //当两者交错时停止

		if(i<right){
			quickSort(strDate,i,right);
		}
		if(j>left){
			quickSort(strDate,left,j);
		}
	}
		
	public static void main(String[] args){
		String[] strVoid=new String[]{"11","66","22","0","55","22","0","32"};
		QuickSort sort=new QuickSort();
		sort.quickSort(strVoid,0,strVoid.length-1);
		for(int i=0;i<strVoid.length;i++){
		System.out.println(strVoid[i]+" ");
		}
	}

}