顺序查找实现 Sequential Search

	/**
	 * 顺序查找实现 Sequential Search
	 */
	 public static function sequentialSearch(k:int, a:Array):int {
	 	var index:int = -1;
	 	for(var i:int = 0; i
二分查找实现
/**
	 * 二分查找实现
	 */
	public static function binarySearch(k:int, a:Array):int {
		var startIndex:int = 0;
		var endIndex:int = a.length - 1;
		var midIndex:int;
		var index:int = -1;

		while(startIndex <= endIndex) {
			midIndex = int((startIndex + endIndex)/2);
			if(k > a[midIndex]) {
				startIndex = midIndex + 1;
			}else {
				endIndex = midIndex - 1;
			}
			if(k == a[midIndex]) {
				index = midIndex;
			}
		}//end of while
		return index;
	}//end of function binarySearch



----------Post from: @LiGuoliang.com, 欢迎回来~----------

]]>
			http://liguoliang.com/2008/actionscript%e5%ae%9e%e7%8e%b0%e9%a1%ba%e5%ba%8f%e6%9f%a5%e6%89%be%e4%ba%8c%e5%88%86%e6%9f%a5%e6%89%be/feed/
		1