Sort

阅读更多
BubbleSort.Java

package sort;

public class BubbleSort {

    public static void main(String[] args) {
		int[] number={6,7,8,5,4,1,2,3};
//		bubbleSort(number);
		int low=0;
		int high=number.length-1;
	    quickSort(number,low,high);
		//print 
		for(int i=0;inumber[i+1]){
					tempt=number[i+1];
					number[i+1]=number[i];
					number[i]=tempt;
					continueSort=true;				
				}			
			}		
		}
	}
	//recursion quickSort
	private static void quickSort(int[] number,int low,int high) {
	    if(low=pivotkey)
				high--;
			number[low]=number[high];
			while(low 
  

 

你可能感兴趣的:(快速排序,冒泡排序)