2021-08-04

插入排序

void insertionSort(int *p,int len)
{
	for (int j = 1; j < len; j++)
	{
		for (int i = j - 1; i >= 0 && p[i] > p[i + 1]; i--)
		{
			int tem = p[i];
			p[i] = p[i + 1];
			p[i + 1] = tem;
		}
	}
}

二进制转换

void to_binary(int n)
{
	if (n == 0)return;
	to_binary(n / 2);
	cout << n % 2;
}

判断素数

void isPrime(int n)
{
	bool flag=true;
	for (int i = 2; i < sqrt(n); i++)
	{
		if ((n % i) == 0)
		{
			flag = false;
			break;
		}
	}
	if (flag)cout << "YES" << endl;
	else cout << "NO" << endl;
}