分治递归实现二分查找
@implementationViewController{
NSArray *arr;
NSIntegertarget;
}
- (void)viewDidLoad {
[super viewDidLoad];
// Do any additional setup after loading the view, typically from a nib.
arr = @[@2,@5,@10,@20,@30,@40,@50,@100];
target=30;
[self getResutWithMin:0 WithMax:arr.count - 1];
}
- (void)getResutWithMin:(NSInteger)low WithMax:(NSInteger)high{
NSIntegermid = (low + high) /2;
if([arr[mid]integerValue] ==target) {
NSLog(@"哈哈%ld",mid);
return;
}
//比目标值大，在左边
else if([arr[mid]integerValue] >target){
[self getResutWithMin:low WithMax:mid -1];
}
//比目标值小，在右边
else if([arr[mid]integerValue]
[self getResutWithMin:mid +1 WithMax:high];
}
}
