<? PHP /* ** PHP Binary Search Method */ $ Arr = Array (, 9 ); Function Search ( $ Arr , $ Low , $ High , $ K ){ If ( $ High > = $ Low ){ $ Middle = Intval (( $ High + $ Low )/2 ); // No difference between Ceil and intval If ( $ Arr [ $ Middle ] = $ K ){ Return 'Found';} Elseif ( $ Arr [ $ Midddle ]> $ K ){ Return Search ( $ Arr , $ Low , $ Middle -1, $ K );} Else { Return Search ( $ Arr , $ Middle + 1, $ High , $ K );}} Return 'None' ;} // Echo search ($ arr, 0, count ($ ARR)-1, 3 ); /* ** PHP Traversal */ Function Seq_sch ( $ Array ,$ N , $ K ){ $ Array [ $ N ] = $ K ; For ( $ I = 0; $ I < $ N ; $ I ++ ){ If ( $ Array [$ I ] = $ K ){ Break ;}} If ( $ I < $ N ){ Return $ I ;} Else { Return -1;}} // Delete a linear table // the pointer of the value to be deleted points to the following value and then deletes the excess pointer at the end. Here, the pointer is a little too far-fetched. Function Test ( $ Arr , $ I ){ $ Length = Count ( $ Arr ); For ( $ J = $ I ; $ J < $ Length ; $ J ++ ){ $ Arr [ $ J ] = $ Arr [ $ J + 1 ];} Array_pop ( $ Arr ); Return $ Arr ;} // Print_r (test ($ arr, 1); // bubble sort $ Arr = Array (3, 2, 8, 1, 4 ); $ N = Count ( $ Arr ); For ( $ I = 0; $ I < $ N ; $ I ++ ){ For ( $ J = $ N -1; $ J > $ I ; $ J -- ){ If ( $ Arr [ $ J ] < $ Arr [ $ J -1 ]) { $ Temp =$ Arr [ $ J ]; $ Arr [ $ J ] = $ Arr [ $ J -1 ]; $ Arr [ $ J -1] = $ Temp ;}}} Print_r ( $ Arr ); ?>