- // $low and $high have to be integers
-
- function BinarySearch( $array, $key, $low, $high )
- {
- if( $low > $high ) // termination case
- {
- return -1;
- }
-
- $middle = intval( ( $low $high )/2 ); // gets the middle of the array
-
- if ( $array[$middle] == $key ) // if the middle is our key
- {
- return $middle;
- }
- elseif ( $key < $array[$middle] ) // our key might be in the left sub-array
- {
- return BinarySearch( $array, $key, $low, $middle-1 );
- }
-
- return BinarySearch( $array, $key, $middle 1, $high ); // our key might be in the right sub-array
- }
|
php
本網站聲明
本文內容由網友自願投稿，版權歸原作者所有。本站不承擔相應的法律責任。如發現涉嫌抄襲或侵權的內容，請聯絡admin@php.cn
作者最新文章
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
