摘要：
/***折半查找：适用于关键字有序的顺序表的查找**/#include<stdio.h>int binarySearch(int a[],int n, int key){int low = 0,high = n - 1;while(low <= high){int mid = (low + high)/2;if(a[mid] == key)return mid;if(a[mid]... 阅读全文
posted @ 2010-10-15 23:57 生无涯 阅读(162) 评论(0) 推荐(0) 编辑