1.冒泡排序
static public void bubbleSort ( int [ ] array) {
for ( int i = 0 ; i < array. length- 1 ; i++ ) {
for ( int j= 1 ; j< array. length- i; j++ ) {
if ( array[ j- 1 ] > array[ j] ) {
array[ j- 1 ] ^= array[ j] ;
array[ j] ^= array[ j- 1 ] ;
array[ j- 1 ] ^= array[ j] ;
}
}
}
System . out. println ( Arrays . toString ( array) ) ;
}
2.选择排序
static public void selectionSort ( int [ ] array) {
for ( int i = 0 ; i < array. length- 1 ; i++ ) {
int min= i;
for ( int j = i+ 1 ; j < array. length ; j++ ) {
if ( array[ min] > array[ j] ) {
min= j;
}
}
if ( min!= i) {
array[ i] ^= array[ min] ;
array[ min] ^= array[ i] ;
array[ i] ^= array[ min] ;
}
}
System . out. println ( Arrays . toString ( array) ) ;
}
3.插入排序
static public void insertSort ( int [ ] array) {
for ( int i = 0 ; i < array. length; i++ ) {
int temp= array[ i] ;
int j= 0 ;
for ( j= i; j> 0 && temp< array[ j- 1 ] ; j-- ) {
array[ j] = array[ j- 1 ] ;
}
array[ j] = temp;
}
System . out. println ( Arrays . toString ( array) ) ;
}