void function ( int [ ] arg0 ) { int [ ] loc0 = new int [ 4 ] ; int loc1 = 0 ; for ( int loc2 = 0 ; loc2 < 2 ; loc2 ++ ) { loc0 [ loc1 ] = arg0 [ loc2 ] ; loc1 += 2 ; } loc1 = 1 ; for ( int loc2 = 2 ; loc2 < 4 ; loc2 ++ ) { loc0 [ loc1 ] = arg0 [ loc2 ] ; loc1 += 2 ; } for ( int loc2 = 0 ; loc2 < arg0 . length ; loc2 ++ ) { arg0 [ loc2 ] = loc0 [ loc2 ] ; } }
apply a `` perfect shuffle '' to the argument . the perfect shuffle algorithm splits the deck in half , then interleaves the cards in one half with the cards in the other . concode_field_sep int SHUFFLE_COUNT concode_field_sep void selectionShuffle concode_elem_sep void main