1.冒泡排序

package com.holo.test;

public class BuddleSort {
public  static void sort(int[] data){
		
		for(int i=0;i<data.length;i++)
		{
			//比较的次数
			for(int j=0;j<data.length-1-i;j++)
			{
				if(data[j]>data[j+1])
				{
					int t = data[j];
					data[j] = data[j+1];
					data[j+1] = t;
				}
			}
		printData(data);
		}
	}
	static void printData(int[]data){
		for(int m=0;m<data.length;m++)
		{
			if(m==data.length-1)
			{
				System.out.println(data[m]);
				}
			else
			System.out.print(data[m]+",");
		}
	}
	public static void main(String[] args) {
		int[] data= {2,1,3,4,9,5,6,7,0};
		BuddleSort.sort(data);
	}
}

 

 2.插入排序

package com.holo.test;

public class InsertSort {
	public static void insertSort(int[] d){ 
		for(int i = 1;i <d.length; i++){ 
            int j = -1; 
            while(j <= i && d[i] > d[++j]);//�ҵ�element[i]Ӧ�ðڷŵ�λ�ã��˴��������ò����㷨�����Ż� 
        
            if(j < i){ 
                //��j֮�������ƶ�һλ��Ȼ���elements[i]�ƶ���j�� 
                int temp = d[i]; 
                for(int k = i-1;k >= j;k--){ 
                    d[k+1] = d[k]; 
                } 
                d[j] = temp; 
            } 
        } 

} 
//步步保持有顺序
public static void insertsort(int[] d){
	   for (int i=1; i<d.length; i++) {   //插入次数
		   
		      for(int j=0;j<=i-1;j++){//比较次数
		    	  int tmp = d[i];//1,2,5,6,4
		    	  if(tmp<d[j]){//寻找插入点
		    		  for(int m = i-1;m>=j;m--)
		    		  {
		    			  d[m+1] = d[m];
		    		  }
		    		  d[j] = tmp;
		    		  
		    	  }
		      }
		      printData(d);
       } 
}
public static void main(String[] args) {
	//��Ҫ��������飬Ŀǰ�ǰ����������е� 
	int a[] = {5,4,2,6,9,8,7,21}; 
	insertsort(a);
	//�������� 
//	int temp; 
//	for(int i = 1;i<a.length;i++){//i=1 ��ʼ����Ϊ��һ��Ԫ����Ϊ���Ѿ�������˵� 
//	for(int j = i;j>0;j--){ 
//	//���� 
//		if(a[j]<a[j-1]){
//			temp = a[j]; 
//			a[j] = a[j-1]; 
//			a[j-1] = temp; 
//		}
//	} 
//	} 
//	printData(a);

	} 



static void printData(int[] data) {
	for (int m = 0; m < data.length; m++) {
		if (m == data.length - 1) {
			System.out.println(data[m]);
		} else
			System.out.print(data[m] + ",");
	}
}
}

3.归并排序

package com.holo.test;

public class MergeSorts {
	public static void MergeSort(int a[], int left, int right) {
		if (left < right) {
			int mid = (left + right) / 2; // ȡ�е�
			// ���������
			MergeSort(a, left, mid);
			// ���Ҳ�����
			MergeSort(a, mid + 1, right);
			// �ϲ������������鵽����b��,�ٿ�����a��
			merge(a, left, mid, right);
		}
	}

	private static void merge(int c[], int left, int mid, int right) { // �ϲ������������鵽����tmp��
		int tmp[] = new int[right - left + 1];
		int  k = 0; // kΪtmp������±�
		int i = left;
		int j = mid + 1;
		while (i <= mid && j <= right) {
			if (c[i] > c[j]) {
				tmp[k++] = c[j++];
			} else {
				tmp[k++] = c[i++];
			}
		}
		while(j<=right)
		{
			tmp[k++] = c[j++];
		}
		while(i<=mid)
		{
			tmp[k++] = c[i++];
		}

		// 复制回数组
		int pos = left;
		for (k = 0; k < tmp.length ; k++) {
			c[pos++] = tmp[k];
			
		}
		printData(c);
	}

	static void printData(int[] data) {
		for (int m = 0; m < data.length; m++) {
			if (m == data.length - 1) {
				System.out.println(data[m]);
			} else
				System.out.print(data[m] + ",");
		}
	}

	public static void main(String[] args) {
		int a[] = { 20, 19, 35, 33, 17, 42, 15, 55, 9, 5, 8, 3, 1 };
		MergeSort(a, 0, a.length - 1);
	}
}

4.快速排序

package com.holo.test;

public class QuickSort {
public static int getMiddle(int[] data,int low,int high){
	int provalue = data[low];
	
	//核心算法：左边放比基数小的，右边放比基数大的
	
	while(low<high){
		while(low<high && provalue< data[high]){
			high--;
		}
		data[low] = data[high];
		while(low<high && provalue> data[low]){
			low++;
		}
		data[high] = data[low];
		data[low] = provalue;
	}
	return low;
}
public static void _quickSort(int[] list, int low, int high) {  
    if (low < high) {  
        int middle = QuickSort.getMiddle(list, low, high);  //��list�������һ��Ϊ��  
        _quickSort(list, low, middle - 1);        //�Ե��ֱ���еݹ�����  
        _quickSort(list, middle + 1, high);    
    }  
} 
static void printData(int[] data) {
	for (int m = 0; m < data.length; m++) {
		if (m == data.length - 1) {
			System.out.println(data[m]);
		} else
			System.out.print(data[m] + ",");
	}
}
public static void main(String[] args) {
	int a[] = { 20, 19, 35, 33, 17, 42, 15, 55, 9, 5, 8, 3, 1 };
	QuickSort._quickSort(a,0,a.length-1);
	printData(a);
}
}

5. 选择排序

package com.holo.test;

public class SelectSort {
	public static void swap(int[]data,int i,int j){
		int t = data[i];
		data[i] = data[j];
		data[j] = t;
	}
	//最值
	public  static void sort(int[] data){
		
		for(int i=0;i<data.length;i++)
		{
			int min = data[i];
			int minIndex = i;
			System.out.println("minbefor:"+min);
			//�ҳ���Сֵ
			for(int j=i+1;j<data.length;j++)
			{
				if(min>data[j])
				{
					min = data[j];
					minIndex = j;
				}
				
			}
			System.out.println("minafter:"+min);
			//��Сֵ���I����λ��
			if(data[i]!=min)
			{
				int t = data[i];
				data[i] = data[minIndex];
				data[minIndex] = t;
			}
		
		printData(data);
		}
	}
	static void printData(int[]data){
		for(int m=0;m<data.length;m++)
		{
			if(m==data.length-1)
			{
				System.out.println(data[m]);
				}
			else
			System.out.print(data[m]+",");
		}
	}
	public static void main(String[] args) {
		int[] data= {2,1,3,4,9,5,6,7,0};
		SelectSort.sort(data);
		
	}
}

 

以上几种排序是最基本的排序，经常会在面试中遇到，记录一下