冒泡排序：在随机产生的数组中查找最值，实现数组的排序

冒泡排序算法：

<span style="white-space:pre"></span>time_t ts;unsigned int data = time(&ts);srand(data);int a[100];printf("随机数组元素：\n");for (int i = 0; i < 100; i++){a[i] = rand() % 100;printf("%d   ", a[i]);}printf("\n输入要查找的数据：");int num, flag = 0;scanf("%d", &num);for (size_t i = 0; i < 100; i++){if (num == a[i]){printf("找到！\n");flag = 1;break;}}if (flag){printf("存在该数！\n");}else{printf("不存在该数！\n");}int max = a[0], min = a[0];int maxi = -1, mini = -1;//记录下标for (size_t i = 0; i < 100; i++){//数组最大值if (a[i]>max){max = a[i];maxi = i;}//数组最小值if (a[i] < min){min = a[i];mini = i;}}printf("数组 第%d个元素最大：%d        数组 第%d个元素最小：%d\n", maxi+1, max, mini+1, min);//数组排序  冒泡法for (int i = 0; i < 100 - 1; i++){for (int j = 0; j < 100 - i - 1; j++){if (a[j] < a[j + 1]){int temp = a[j];a[j] = a[j + 1];a[j + 1] = temp;}}}printf("\n排序后的数组：\n");for (int i = 0; i < 100; i++){printf("%d   ", a[i]);}

测试效果：