# 测试简单数学算法

0

0
``````
# include <stdio.h>
# include <stdlib.h>
# include <string.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); \
}

void quick_sort(int* num, int l, int r)
{
if (r <= l) return;
int x = l, y = r, z = num[l];
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 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 20
int arr[MAX_OP];
randint(arr, MAX_OP);
TEST(arr, MAX_OP, select_sort, num, MAX_OP);
TEST(arr, MAX_OP, quick_sort, num, 0, MAX_OP - 1);
return 0;
}
``````

Rosiness^ | 初学一级 |园豆：47 | 2021-01-19 17:53

0

0

vscoe python

您需要登录以后才能回答，未注册用户请先注册