选择排序
选择排序不同于冒泡排序,冒泡排序是两两比较,选择排序是第一个元素分别和剩余元素逐个比较
#include <stdio.h>
#include <stdlib.h>
void selection_sort(int *p, int len)
{
int i;
int j;
int tmp;
for (i = 0; i < len - 1; i++)
{
for (j = i + 1; j < len ; j++)
{
if (p[i] > p[j])
{
tmp = p[i];
p[i] = p[j];
p[j] = tmp;
}
}
}
for (i = 0; i < len; i++)
{
printf("%d ", *(p + i));
}
}
int main()
{
int len;
scanf_s("%d", &len);
int* p = (int*)malloc(sizeof(int) * len);
if (p == NULL)
{
return 1;
}
else
{
for (int i = 0; i < len; i++)
{
scanf_s("%d", p + i);
}
selection_sort(p, len);
}
free(p);
return 0;
}
结果