java实现冒泡排序和快速排序

冒泡排序

package t;

public class Bubble {
public static void main(String args[]) {
	int arr[]={5,7,1,3,8,12,6,2};
	for(int i=0;i<arr.length-1;i++) {
		for(int j=i+1;j<arr.length;j++) {
			if(arr[j]<arr[i]) {
				int t=arr[j];
				arr[j]=arr[i];
				arr[i]=t;
			}
			}
	}
	for(int i=0;i<arr.length;i++) {
	  System.out.println(arr[i]);
	}
	
}
}

快速排序

package t;

public class FastOrder {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[]={5,7,1,3,8,12,6,2,100,20};
		swap(arr,0,arr.length-1);
		for(int i=0;i<arr.length;i++) {
			System.out.print(arr[i]+"  ");
		}
	
	}
	 public static void swap(int arr[],int left,int right) {
		 int tleft=left;
		 int tright=right;
		 int key=arr[left];
		 while(right>left) {
			 while(right>left&&arr[right]>key) right--;
			 arr[left]=arr[right];
			 while(right>left&&arr[left]<key) left++;
			 arr[right]=arr[left];
		 }
		 arr[left]=key;
		 if(left>tleft) {
			 swap(arr, tleft, left-1);}
		if(right<tright) {
				 swap(arr, left+1, tright);
			}
		 
		 
	 }

}