选择排序
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void text01(int arr[],int len)
{
int min = 0;
int temp = 0;
int j = 0;
for (int i = 0; i < len; i++)
{
min = i;
for (j = i + 1; j < len; j++)
{
if (arr[min] > arr[j])
{
min = j;
}
}
if (min != i)
{
temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}
for (int i = 0; i < len; i++)
{
printf("%d\n", arr[i]);
}
}
int main()
{
int arr[] = { 2,5,2,3,6,3 };
int len = sizeof(arr) / sizeof(arr[0]);
text01(arr, len);
system("pause");
return 0;
}
冒泡排序
for (size_t i = 0; i < n-1; i++)
{
for (size_t j = 0; j < n - 1 - i; j++)
{
if (xjp[j] > xjp[j + 1])
{
temp = xjp[j];
xjp[j] = xjp[j + 1];
xjp[j + 1] = temp;
}
}
}
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/85db6140b43898f8ad736e3d4bef2e9d.webp?x-image-process=image/format,png)