学习算法手记【原】- 二分查找

==========================================================
author ：Vange
create-time: 2010-03-10
http://hi.baidu.com/romeroad/blog/item/8aa0efc4c6f473c038db496c.html
==========================================================

在大学的时候，曾经觉得这个算法是多么的不可思议，觉得计算机真的很了不起，我都无法去递归相像它。同时递归原来还可以改为非递归。这样对空间的把握就更好了。就说递归进去后不一定需要一层一层出来。如果条件允许的话，可以直接跳转出来。呵呵，这就是可以改进的地方。

===========================================
#include <stdio.h> int BinarySearch(int *arr, int n, int val) { int low,high,mid; low = 0, high = n - 1; while (low <= high) { mid = (low + high)/2; if(arr[mid] > val) high = mid - 1; else if (arr[mid] < val) low = mid + 1; else if (arr[mid] == val) return mid; } return -1; } main() { int ints[] = {11, 22, 33, 44, 55, 66}; int *pArr = ints; int size = sizeof(ints)/sizeof(*ints); //刚学习的计算数组大小，但暂时没有发现更有用的地方 printf(" the position of 11 is : %d /n", BinarySearch(pArr, size, 11)); printf(" the position of 44 is : %d /n", BinarySearch(pArr, size, 44)); printf(" the position of 25 is : %d /n", BinarySearch(pArr, size, 25)); }

===========================================