学步园

二分法查找

#include <iostream><br /> using namespace std;<br /> void insert_sort(int a[], int len);<br /> int search_binary(int arr[], int key, int len);<br /> int main()<br /> {<br /> int intarr[6] = {3,6,2,1,23,9};<br /> insert_sort(intarr,6);<br /> for(int i=0; i< 6; i++)<br /> cout << intarr[i] << " ";<br /> cout << endl;<br /> cout << search_binary(intarr,23,6);<br /> }<br /> void insert_sort(int a[], int len)<br /> {<br /> int insert=0;<br /> int temp = 0;<br /> for( int i=0; i< len -1; i++)<br /> {<br /> insert = i+1;<br /> while( insert && a[insert -1] > a[insert] )<br /> {<br /> temp = a[insert];<br /> a[insert] = a[insert -1];<br /> a[insert -1] = temp;<br /> --insert;<br /> }<br /> }<br /> }<br /> int search_binary(int arr[], int key, int len)<br /> {<br /> int low = 0;<br /> int high = len - 1;<br /> int mid;<br /> while (low <= high)<br /> {<br /> mid = (high + low) / 2;<br /> if (arr[mid] > key)<br /> high = mid - 1;<br /> else if (arr[mid] < key)<br /> low = mid + 1;<br /> else<br /> return mid;<br /> }<br /> return -1;<br /> }