简单的选择排序

main.c

#define _CRT_SRCURE_NO_WARNING
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>
#include<sys/timeb.h>

#define MAX 20000

long getSystemTime()
{
	struct timeb tb;
	ftime(&tb);
	return tb.time * 1000 + tb.millitm;
}

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

//选择排序
void SelectSort(int arr[],int length)
{
	for (int i = 0; i < length; i++)
	{
		int min = i;
		for (int j = i + 1; j < length; j++)
		{
			if (arr[j] < arr[min])
			{
				min = j;
			}
		}
		if (min != i)
		{
			swap(&arr[min], &arr[i]);
		}
	}
}

//冒泡排序
void BubbleSort(int arr[], int length)
{
	for (int i = 0; i < length; i++)
	{
		for (int j = 0; j < length - i - 1; j++)
		{
			if (arr[j + 1] <= arr[j])
			{
				swap(&arr[j + 1], &arr[j]);
			}
		}
	}
}

void PrintArray(int arr[], int length)
{
	for (int i = 0; i < length; i++)
	{
		printf("%d", arr[i]);
	}
	printf("\n");
}


int main()
{
	int arr[MAX];
	srand((unsigned int)time(NULL));
	for (int i = 0; i < MAX; i++)
	{
		arr[i] = rand() % MAX;
	}
	
	//选择排序时间
	long t_start = getSystemTime();
	SelectSort(arr, MAX);
	long t_end = getSystemTime();
	printf("选择排序时间：%d\n", t_end - t_start);

	//冒泡排序时间
	long t1_start = getSystemTime();
	BubbleSort(arr, MAX);
	long t1_end = getSystemTime();
	printf("冒泡排序时间：%d\n", t1_end - t1_start);

	return 0;
}