排序算法
快速排序
private static void quickSort ( int [ ] a, int start, int end) {
if ( a. length < 0 ) {
return ;
}
if ( start >= end) {
return ;
}
}
int left = start;
int right = end;
int temp = a[ left] ;
while ( left < right) {
while ( left < right && a[ right] >= temp) {
right-- ;
}
a[ left] = a[ right] ;
while ( left < right && a[ left] <= temp) {
left++ ;
}
a[ right] = a[ left] ;
}
a[ left] = temp;
quickSort ( a, start, left - 1 ) ;
quickSort ( a, left + 1 , end) ;
}
冒泡排序
public void bubbleSort ( Integer [ ] a) {
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;
}
}
}
}