#include <stdio.h>
int main()
{
int arr[10] = {49, 38, 65, 97, 76, 13, 27, 49, 55, 48};
printf("直接插入\n");
int temp;
int j;
for (int i = 1; i < 10; i++)
{
temp = arr[i];
for (j = i - 1; j >= 0 && temp < arr[j]; j--)
arr[j + 1] = arr[j];
arr[j + 1] = temp;
printf("第%d趟: ", i);
for (int a = 0; a < 10; a++)
{
printf("%d ", arr[a]);
}
printf("\n");
}
return 0;
}
/*
* @Author: hongbin
* @Date: 2021-12-13 10:35:11
* @LastEditors: hongbin
* @LastEditTime: 2021-12-13 10:46:08
* @Description: 简单排序 每次选出最小，交换
*/
#include <stdio.h>
int main()
{
int arr[10] = {49, 38, 65, 97, 76, 13, 27, 49, 55, 48};
printf("简单排序\n");
for (int i = 0; i < 9; i++)
{
int temp = arr[i];
int tempIndex = i;
for (int j = i; j < 10; j++)
{
if (arr[j] < temp)
{
temp = arr[j];
tempIndex = j;
}
}
// 交换
arr[tempIndex] = arr[i];
arr[i] = temp;
printf("第%d躺: ", i + 1);
for (int a = 0; a < 10; a++)
{
printf("%d ", arr[a]);
}
printf("\n");
}
return 0;
}
#include <stdio.h>
int main()
{
int arr[10] = {49, 38, 65, 97, 76, 13, 27, 49, 55, 48};
printf("冒泡排序\n");
for (int i = 0; i < 9; i++)
{
for (int j = i + 1; j < 10; j++)
{
if (arr[i] > arr[j])
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
printf("第%d趟: ", i + 1);
for (int x = 0; x < 10; x++)
{
printf("%d ", arr[x]);
}
printf("\n");
}
return 0;
}
