折半查找-算法笔记

折半查找：

也即是二分查找，mid=(low+high)/2;

如果value=a[mid],就找到了

如果Value<a[mid],那么value在（low，mid-1）中，若value>a[mid],那么value在（mid+1，high）中

#include<iostream>
#include<bits/stdc++.h>
#include<vector>
using namespace std;
//快速排序
void qsort(int a[], int left, int right) {
	if (left > right) {
		return;
	}
	int t = a[left];
	int low = left;
	int high = right;
	while (low < high) {
		while (a[high] >= t && low < high) {
			high--;
		}
		while (a[low] <= t && low < high) {
			low++;
		}
		if (low < high) {
			swap(a[low], a[high]);
		}
	}
	swap(a[left], a[low]);
	qsort(a, left, low - 1);
	qsort(a, low + 1, right);
}
//查找（找到，返回下标，没找到，返回-1）
int binarysearch(int a[],int low,int high, int value) {
	if (low > high) {
		return -1;
	}
	else {
		//int mid = (low + high) / 2;
		int mid = low + (value - a[low]) / (a[high] - a[low]) * (low + high);
		if (a[mid] == value) {
			return mid;
		}
		else if (value < a[mid]) {
			return binarysearch(a, low, mid - 1, value);
		}
		else {
			return binarysearch(a, mid + 1, high, value);
		}
	}
}

int main() {
	int a[6] = { 2,3,5,0,4,1 };
	int value;
	cin >> value;
	qsort(a, 0, 5);
	/*for (int i = 0; i < 6; ++i) {
		cout << a[i] << " ";
	}*/
	cout<<binarysearch(a,0,5,value)<<endl;
	
	return 0;
}