| 务虚笔记 - wuxubj,个人博客

选择排序算法C语言实现

//选择排序算法
void sort(int list[], int n)
{
	for (int i = 0; i < n - 1; i++)
	{
	//	int min = i;
		for (int j = i + 1; j < n;j++)
		if (list[j] < list[i])
	//		min = j;
		select_swap(list+j, list+i);
	}
}

void select_swap(int *a, int *b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}

测试主函数

//测试主函数
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MAX_SIZE 100
void select_swap(int *a, int *b);
void sort(int list[], int n);
int main()
{	
	int num;
	int list[MAX_SIZE];
	printf("Enter the number of numbers to generate:");
	scanf_s("%d", &num);
	if (num<1 || num>MAX_SIZE)
	{
		fprintf(stderr, "Improper value of n.\n");
		exit(1);
	}
	for (int i = 0; i < num; i++)
	{
		list[i] = rand() % 1000;
		printf("%d ", list[i]);
	}
	sort(list, num);
	printf("\nsorted array:\n");
	for (int i = 0; i < num; i++)
		printf("%d ", list[i]);
	printf("\n");
	system("pause");
	return 0;
}