选择排序法
public class SelectionSort{
private SelectionSort(){}
public static void sort(Comparable[] arr){
int n = arr.length;
for(int i = 0 ;i < n; i++){
int minIndex = i;
for(int j = i+1 ; j < n; j++){
if(arr[minIndex].compareTo(arr[j])>0){
minIndex = j;
}
}
swap(arr,minIndex,j);
}
}
private static void swap(Object[] arr,int index1,int index2){
Object o = arr[index1];
arr[index1] = arr[index2];
arr[index2] = o;
}
}
冒泡排序
写法1
public class BubbleSort {
private BubbleSort(){}
public static void sort(Comparable[] arr){
int n = arr.length;
boolean swapped = false;
do{
swapped = false;
for( int i = 1 ; i < n ; i ++ )
if( arr[i-1].compareTo(arr[i]) > 0 ){
swap( arr , i-1 , i );
swapped = true;
}
n --;
}while(swapped);
}
private static void swap(Object[] arr, int i, int j) {
Object t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
改进写法
public class BubbleSort2 {
private BubbleSort2(){}
public static void sort(Comparable[] arr){
int n = arr.length;
int newn;
do{
newn = 0;
for( int i = 1 ; i < n ; i ++ )
if( arr[i-1].compareTo(arr[i]) > 0 ){
swap( arr , i-1 , i );
newn = i;
}
n = newn;
}while(newn > 0);
}
private static void swap(Object[] arr, int i, int j) {
Object t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
插入排序法 Insertion Sort
public class InsertionSort{
private InsertionSort(){}
public static void sort(Comparable[] arr){
int n = arr.length;
for(int i = 0; i < n ; i++){
Comparable comparable = arr[i];
int j = i;
for(;j > 0 && arr[j-1].compareTo(comparable)>0 ;j--){
arr[j] = arr[j-1];
}
arr[j] = comparable;
}
}
private static void swap(Object[] arr,int index1, int index2){
Object object = arr[index1];
arr[index1] = arr[index2];
arr[index2] = object;
}
}
希尔排序 ShellSort
- 希尔排序就是在InsertionSort改进而来的。只是设置了交换步长,当步长逐渐缩小唯一的时候,就InsertionSort,只是此时,该数列基本有序,此时插入排序的性能十分优异。
- 时间复杂度O(n^1.5)
public class ShellSort{
private ShellSort() {
}
public static void sort(Comparable[] arr){
int n = arr.lenght;
int h = 1;
while(h < n/3) h = h*3+1;
while(h >= 1){
for(int i = h ; i < n ; i++){
Comparable comparable = arr[i];
int j = i;
for(;j>=h && comparable.compareTo(arr[j-h])<0;j -= h){
arr[j] = arr[j - h];
}
arr[j] = comparable;
}
h /= 3;
}
}
}