int [ ] function ( ) { boolean loc0 = true ; do { loc0 = true ; for ( int loc1 = 1 ; loc1 < array . length ; loc1 ++ ) { if ( array [ loc1 - 1 ] < array [ loc1 ] ) { swap ( loc1 - 1 , loc1 ) ; loc0 = false ; } } } while ( ! loc0 ) ; return array ; }
use bubblesort to `` wrongly '' sort an int . concode_field_sep int[] array concode_field_sep int[] getSorted concode_elem_sep void swap