een bepaalde kaart moet worden opgezocht in de gesorteerde array op de binary search manier zoals besproken in hubbard p. 31 . concode_field_sep Card[] cardArray concode_field_sep void cardSwap concode_elem_sep int sequentialSearch concode_elem_sep int hashCode concode_elem_sep void insertAt concode_elem_sep boolean equals concode_elem_sep String toString concode_elem_sep void sort concode_elem_sep int compareTo concode_elem_sep boolean isSorted concode_elem_sep void fill concode_elem_sep void shuffle concode_elem_sep void delete
int function ( Card arg0 ) { int loc0 = 0 ; try { while ( ! cardArray [ loc0 ] . equals ( arg0 ) ) { loc0 ++ ; } } catch ( ArrayIndexOutOfBoundsException loc1 ) { return - 1 ; } return binarySearch ( arg0 , cardArray ) ; }