冒泡排序、简单选择排序和插入排序(java实现)

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/ASJBFJSB/article/details/83104102

public class Sort{

	public stativ <T> void swao(T[] arr,int i,int j){
		T tmp = arr[i];
		arr[i]] = arr[j];
		arr[j] = tmp;
	}

	//冒泡排序及其优化
	public static <T extends Compapable<T>> void bubbleSort(T[] arr,int n){
		int i,j;
		boolean flag;
		T tmp;
		for(i = 0;i<n-1;++i){
			flag = false;
			for(j = 0;j<n-1-i;++j){
				if(arr[j].compareTo(arr[j+1])>0){
					flag = true;
					swao(arr,j,j+1);
				}
			}
			if(flag == false)break;
		}
	}


	//选择排序及其优化
	public static <T extends Comparable<T>> void selectSort(T[] arr,int n){
		int left = 0;
		int right = n-1;
		while(left < right){
			int minIndex = left;
			int maxIndex = right;
			if(arr[minIndex].compareTo(arr[maxIndex])>0){
				swap(arr,minIndex,maxIndex);
			}
			for(int i=left+1;i<right;++i){
				if(arr[i].compareTo(arr[minIndex])<0){
					minIndex = i;
				}
				else if(arr[i].compareTo(arr[maxIndex])>0){
					maxIndex = i;
				}
			}
			if(left!=minIndex){swap(arr,left,minIndex);}
			if(right!=maxIndex){swap(arr,right,maxIndex);}
			left++;
			right--;
		}
	}

	public static <T extends Comparable<T>> void insertSort(T[] arr,int n){
		for(int i=1;i<n;++i){
			T tmp = arr[i];
			int j;
			for(j=i;j>0 && arr[j-1].compareTo(tmp)>0;--j){
				arr[j] = arr[j-1];
			}
			arr[j] = tmp;
		}
	}
}