算法（二分查找、选择排序）

二分查找

#include<iostream>
using namespace std;

int binarySearch(int arr[], int len, int num)
{
	int min = 0, max = len - 1;
	while (min<max)
	{
		int mid = (min + max) / 2;
		if (arr[mid] > num)
		{
			max = mid - 1;;
		}
		else if (arr[mid] <  num)
		{
			min = mid + 1;
		}
		else
		{
			return mid;
		}
	}
	return -1;
}

int main()
{
	int arr[10] = { 0 };
	int len = sizeof(arr) / sizeof(int);
	int num;
	for (int i = 0; i < len; i++)
	{
		cin >> arr[i];
	}
	cout << "请输入想要查询的数字：" << endl;
	cin >> num;
	int ret=binarySearch(arr, len, num);
	cout << ret << endl;

	system("pause");
	return 0;
}

选择排序

#include<iostream>
using namespace std;
int main()
{
	int arr[10] = { 6,3,2,1,5,7,8,4,9,0 };
	int len = sizeof(arr) / sizeof(int);
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = i + 1; j < len; j++) 
		{
			if (arr[j] < arr[i])
			{
				int temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
			}
		}
	}
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << endl;
	}
	system("pause");
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int arr[10] = { 6,3,2,1,5,7,8,4,9,0 };
	int len = sizeof(arr) / sizeof(int);
	for (int i = 0; i < len - 1; i++)
	{
		int flag = i;
		for (int j = i + 1; j < len; j++) 
		{
			if (arr[j] < arr[i])
			{
				flag = j;
			}
		}
		if (flag != i)
		{
			int temp = arr[i];
			arr[i] = arr[flag];
			arr[flag] = temp;
		}
	}
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << endl;
	}
	system("pause");
	return 0;
}

冒泡排序

#include<iostream>
using namespace std;
int main()
{
	int arr[10] = { 6,3,2,1,5,7,8,4,9,0 };
	int len = sizeof(arr) / sizeof(int);
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = 0; j < len - i - 1; j++)
		{
			if (arr[j] > arr[j+1])
			{
				int temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << endl;
	}
	system("pause");
	return 0;
}