to restore the max-heap condition when a node 's priority is increased . we move up the heap , exchaning the node at position k with its parent at postion k/2 if necessary , continuing as long as a k/2 < a k or until we reach the top of the heap . concode_field_sep PlaceHolder placeHolder concode_field_sep void siftDown concode_elem_sep void siftDown concode_elem_sep void siftDown concode_elem_sep void siftDown concode_elem_sep void swap concode_elem_sep void swap concode_elem_sep void swap concode_elem_sep void swap
void function ( float [ ] arg0 , int arg1 ) { while ( arg1 > 1 && arg0 [ arg1 / 2 ] < arg0 [ arg1 ] ) { swap ( arg0 , arg1 , arg1 / 2 ) ; arg1 = arg1 / 2 ; } }