19.c

来自「自己做的常用库和实现的数据结构。public domain.」· C语言 代码 · 共 44 行

#include "my.h"
int cmp(const void *a, const void *b)
{
	return *((int *)a) - *((int *)b);
}
void swap(void *a, void *b)
{
	int t;
	t = *((int *)a); *((int *)a) = *((int *)b); *((int *)b) = t;
}
int main()
{
	int a[10];
	int i;
	void *p;
	srand(time(NULL));
	for(i=0; i<10; i++)
		printf("%d ", a[i] = rand() % 100);
	p = (getelem(a, sizeof(int), 2));
	printf("\n%d", *((int *)p));
	if(asc_or_desc(a, 10, sizeof(int), cmp))
			puts("key word ordered");
	else
			puts("not key word ordered");

	ssort(a, 10, sizeof(int), cmp, swap);
	puts("");
	for(i=0; i<10; i++)
		printf("%d ", a[i]);
	if(asc_or_desc(a, 10, sizeof(int), cmp))
			puts("key word ordered");
	else
			puts("not key word ordered");

	for(i=0; i<10; i++)
		printf("%d ", a[i] = rand() % 100);
	bsort(a, 10, sizeof(int), cmp, swap);
	puts("");
	for(i=0; i<10; i++)
		printf("%d ", a[i]);

	return 0;
}