一篇文章让你明白查找排序（搜索函数，猜数字）

搜索函数

从一个任给数组中找一个数，找到返回该数在数组中的下标，找不到返回-1

int search(int key, int arr[], int len)
{
	int ret = -1;
	int i = 0;
	for (i = 0; i < len; i++)
	{
		if (key == arr[i])
		{
			ret = i;
			break;//只要找到，退出循环
		}
	}
	return ret;//若找不到，返回-1
}

int main()
{
	int a[] = { 1,3,2,5,12,14,23,6,9,45 };//有序无序均可
	int r = search(12, a, sizeof(a) / sizeof(a[0]));
	printf("%d\n", r);
	return 0;
}

二分搜索算法

优点：高效
注：必须大小有序排列
从一个有序数组中找一个数，找到返回该数在数组中的下标，找不到返回-1

int search(int key, int arr[], int len)
{
	int ret = -1;
	int left = 0;
	int right = len - 1;
	while (right >= left)
	{
		int mid = (left + right) / 2;
		if (arr[mid] > key)
		{
			right = mid - 1;
		}
		else if (arr[mid] < key)
		{
			left = mid + 1;
		}
		else
		{
			ret = mid;
			break;
		}
	}
	return ret;
}

int main()
{
	int a[] = { 1,5,7,9,12,26,39,44,56,71};
	int r = search(7, a, sizeof(a) / sizeof(a[0]));
	printf("%d\n", r);
}

选择排序算法

任给一个数组，使其从小到大排序

int max(int a[], int len)
{
    int maxid = 0;
    for (int i = 1; i < len; i++)
    {
        if (a[i] > a[maxid])
        {
            maxid = i;
        }
    }
    return maxid;
}

int main()
{
    int a[] = { 2,45,6,12,87,34,90,24,23,11,65 };
    int len = sizeof(a) / sizeof(a[0]);

    for (int i = len - 1; i > 0; i--)
    {
        int maxid = max(a, i + 1);
        int t = a[maxid];
        a[maxid] = a[i];
        a[i] = t;
    }
    for (int i = 0; i < len; i++)
    {
        printf("%d ", a[i]);
    }
    return 0;
}

猜数字游戏

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void menu()
{
 printf("**********************************\n");
 printf("*********** 1.play     **********\n");
 printf("*********** 0.exit     **********\n");
 printf("**********************************\n");
}

void game()//游戏
{
	int random_num = rand() % 100 + 1;
	int input = 0;
	while (1)
	{
		printf("请输入猜的数字>:");
		scanf("%d", &input);
		if (input > random_num)
		{
			printf("猜大了\n");
		}
		else if (input < random_num)
		{
			printf("猜小了\n");
		}
		else
		{
			printf("恭喜你，猜对了\n");
			break;
		}
	}
}

int main()
{
	int input = 0;
	srand((unsigned)time(NULL));//生成随机数
	do
	{
		menu();
		printf("请选择>:");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			game();
			break;
		case 0:
			break;
		default:
			printf("选择错误,请重新输入!\n");
			break;
		}
	} while (input);
	return 0;
}

多个字符从两端移动，向中间汇聚

int main()
{
	char arr1[] = { "welcome to NBA!!!!!!" };
	char arr2[] = { "####################" };
	int left = 0;
	int right = strlen(arr1) - 1;
	while (right >= left)
	{
		arr2[left] = arr1[left];
		arr2[right] = arr1[right];
		printf("%s\n", arr2);
		Sleep(1000);//睡眠1s
		system("cls");//清空屏幕
		left++;
		right--;
	}
	printf("%s\n", arr2);
	return 0;
}