查找

顺序查找 O（n）

#include<iostream>
using namespace std;
int FindValue(const int * ar, int n, int x)
{
	int pos = -1;
	if (ar == nullptr || n <= 0)
	{
		return -1;
	}
	int i = 0;
	while (i < n&&ar[i] != x)//将i<n放前面，即大范围的放前面
	{
		i++;
	}
	if (i < n)//if(br[i]==val)
	{
		pos = i;
	}
	return pos;

}
int main()
{
	const int n = 10;
	int ar[n] = { 23,56,78,90,100,12,34,89,45,67 };
	int x = 0;
	int pos = 0;
	cin >> x;
	pos = FindValue(ar, n, x);

	cout << pos;
	return 0;
}

二分查找（数组有序）O（logn）

//思考：二分，每次将这个序列折半查找形成新的left和right，直到查找到left==right时，还有一个数没有查找，若此时还没有查找到，即left+1>大于了right此时说明查找数不在序列中，找到条件边界
int Searchvalue(const int * ar, int n, int x)
{
	int pos = -1;
	if (ar == nullptr || n <= 0)
		return -1;
	int left = 0;
	int right = n - 1;
	
	while (left<=right)//一直折半，直到left>right(边界条件)
	{
		int mid = ((right - left) >> 1) + left;//避免了(right+left)/2造成的范围越界
		if (ar[mid] == x)
		{
			pos= mid;
			break;
		}
		else if (ar[mid] < x)
		{
			left = mid +1;
		}
		else
		{
			right = mid - 1;
		}
	}
	return pos;

}

int main()
{
	const int n = 10;
	int ar[n] = { 12,23,34,45,67,78,89,90,100 };
	int x = 0;
	int pos = 0;
	cin >> x;
	pos = Searchvalue(ar, n, x);

	cout << pos;

	return 0;
	
}

//二分递归写法

#include<iostream>
using namespace std;
int binary_Search(const int * ar, int left, int right ,int value)
{
	
	if (left > right)//先写终止条件
	{
		return -1;
	}
	int mid = ((right - left) >> 1) + left;
	if (value > ar[mid])
	{
		return binary_Search(ar, mid + 1, right, value);
	}
	else if (value < ar[mid])
	{
		return binary_Search(ar, left, mid - 1, value);
	}
	else
		return mid;
}

int Searchvalue(const int * ar, int n, int x)
{

	if (ar == nullptr || n <= 0)
		return -1;

		return binary_Search(ar, 0, n - 1, x);//不要将一个变量赋予了两种意义，可以重新生成一个变量

}

int main()
{
	const int n = 10;
	int ar[n] = { 12,23,34,45,67,78,89,90,100 ,127};
	int x = 0;
	int pos = 0;
	cin >> x;
	pos = Searchvalue(ar, n, x);
	cout << pos;
	return 0;
}