非稳定排序

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>

#define swap(a, b) { \
	__typeof(a) __temp = a; \
	a = b, b = __temp; \
}

#define TEST(arr, n, func, args...) { \
	int *num = (int *)malloc(sizeof(int) * n);\
	memcpy(num, arr, sizeof(int) * n);\
	output(num, n);\
	printf("%s = ", #func);\
	func(args); \
	output(num, n); \
	free(num);\
}
//选择排序O(N2)
void select_sort(int *num, int n) {
	for (int i = 0; i < n - 1; i++) {
		int ind = i;
		for (int j = i + 1; j < n; j++) {
			if (num[ind] > num[j]) ind = j;
		}
		swap(num[i], num[ind]);
	}
	return ;
}
//快速排序O(NlogN)
void quick_sort(int *num, int l, int r) {
	if (l > r) return;
	int x = l, y = r, z = num[x];
	while (x < y) {
		while (x < y && num[y] > z) --y;
		if (x < y) num[x++] = num[y];
		while (x < y && num[x] < z) ++x;
		if (x < y) num[y--] = num[x];
	}
	num[x] = z;
	quick_sort(num, l, x - 1);
	quick_sort(num, x + 1, r);
	return ;
}
//优化后的快速排序
void qquick_sort(int *num, int l, int r) {
	while (l < r) {
		int x = l, y = r, z = num[(l + r) >> 1];
		do {
			while (x <= y && num[x] < z) x++;
			while (x <= y && num[y] > z) y--;
			if (x <= y) {
				swap(num[x], num[y]);
				x++, y--;
			}
		} while (x <= y);
		qquick_sort(num, x, r);
		r = y;
	}
	return;
}

void randint(int *num, int n) {
	while(n--) num[n] = rand() % 100;
	return;
}

void output(int *num, int n) {
	printf("[");
	for (int i = 0; i < n; i++) {
		printf(" %d", num[i]);
	}
	printf("]\n");
	return;
}

int main() {
	srand(time(0));
#define max_op 22
	int arr[max_op] = {0};
	randint(arr, max_op);

	TEST(arr, max_op, select_sort, num, max_op);
	TEST(arr, max_op, quick_sort, num, 0, max_op - 1);
	TEST(arr, max_op, qquick_sort, num, 0, max_op - 1);
#undef max_op

	return 0;
}