算法笔记

发表于 分类于

二分

1
2
3
4
5
6
7
8
9
10
11
12
13
14
public boolean bin(int[] arr, int tar){  
	int l = 0, r = arr.length - 1;  
	while(l <= r){  
	int mid = l + (r - l) / 2;  
	if(arr[mid] < tar){  
		l = mid + 1;  
		}else if(arr[mid] > tar){  
		r = mid - 1;  
	}else{  
		return true;  
		}  
	}  
return false;  
}