插入排序
import java. util. Arrays;
public class Main {
public static void main ( String[ ] args) {
int [ ] a= { 14 , 65 , 17 , 25 , 36 , 12 , 21 , 13 , 23 , 41 } ;
int index;
int temp;
for ( int i= 1 ; i< a. length; i++ ) {
index= i- 1 ;
temp= a[ i] ;
while ( index>= 0 && a[ index] > temp) {
a[ index+ 1 ] = a[ index] ;
index-- ;
}
a[ index+ 1 ] = temp;
}
System. out. println ( Arrays. toString ( a) ) ;
}
}
冒泡排序
import java. util. Arrays;
public class Main {
public static void main ( String[ ] args) {
int [ ] a= { 14 , 65 , 17 , 25 , 36 , 12 , 21 , 13 , 23 , 41 } ;
int temp= 0 ;
for ( int i= 0 ; i< a. length- 1 ; i++ ) {
for ( int j= 0 ; j< a. length- 1 - i; j++ ) {
if ( a[ j] > a[ j+ 1 ] ) {
temp= a[ j] ;
a[ j] = a[ j+ 1 ] ;
a[ j+ 1 ] = temp;
}
}
}
System. out. println ( Arrays. toString ( a) ) ;
}
}
希尔排序
public class Main {
public static void main ( String[ ] args) {
int [ ] a = { 12 , 5 , 8 , 96 , 54 , 32 , 14 , 57 , 2 , 1 , 4 } ;
int l = a. length;
for ( l = l / 2 ; l > 0 ; l = l / 2 ) {
for ( int i = l; i < a. length; i++ ) {
int j = i;
int count = a[ i] ;
while ( j - l >= 0 && count < a[ j - l] ) {
a[ j] = a[ j - l] ;
j -= l;
}
a[ j] = count;
}
}
System. out. println ( Arrays. toString ( a) ) ;
}
}
选择排序
import java. util. Arrays;
public class Main {
public static void main ( String[ ] args) {
int [ ] a= { 14 , 65 , 17 , 25 , 36 , 12 , 21 , 13 , 23 , 41 } ;
int temp= 0 ;
for ( int i= 0 ; i< a. length- 1 ; i++ ) {
int index= i;
for ( int j= i+ 1 ; j< a. length; j++ ) {
if ( a[ j] > a[ index] ) {
index= j;
}
}
temp= a[ i] ;
a[ i] = a[ index] ;
a[ index] = temp;
}
System. out. println ( Arrays. toString ( a) ) ;
}
}