public static void transform ( int [ ] arr) {
int left = 0 ;
int right = arr. length - 1 ;
while ( left < right) {
while ( left < right && arr[ left] % 2 == 0 ) {
left++ ;
}
while ( left < right && arr[ right] % 2 != 0 ) {
right-- ;
}
int tmp = arr[ left] ;
arr[ left] = arr[ right] ;
arr[ right] = tmp;
}
}
public static void bubbleSort ( int [ ] array) {
boolean flg = false ;
for ( int i = 0 ; i < array. length- 1 ; i++ ) {
flg = false ;
for ( int j = 0 ; j < array. length- 1 - i; j++ ) {
if ( array[ j] > array[ j+ 1 ] ) {
int tmp = array[ j] ;
array[ j] = array[ j+ 1 ] ;
array[ j+ 1 ] = tmp;
flg = true ;
}
}
if ( flg == false ) {
return ;
}
}
}
public static void reverse ( int [ ] array) {
int left = 0 ;
int right = array. length- 1 ;
while ( left < right) {
int tmp = array[ left] ;
array[ left] = array[ right] ;
array[ right] = tmp;
left++ ;
right-- ;
}
}