使用qsort函数排序各种类型的数据 、模仿qsort的功能实现一个通用的冒泡排序

//6.练习使用qsort函数排序各种类型的数据。


#include<stdio.h>
#include<windows.h>
#include<assert.h>

int cmp_int(void *x, void *y)
{
	int *_x = (int*)x;
	int *_y = (int*)y;
	if (*_x > *_y)
	{
		return 1;
	}
	else if (*_x < *_y)
	{
		return -1;
	}
	else
	{
		return 0;
	}
}
int cmp_double(void *x, void *y)
{
	double *_x = (double*)x;
	double *_y = (double*)y;
	if (*_x > *_y)
	{
		return 1;
	}
	else if (*_x < *_y)
	{
		return -1;
	}
	else
	{
		return 0;
	}
}
int main()
{
	//int arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8 };
	double arr[] = { 2.1, 4.6, 8.5, 10.2, 1.0, 3.3, 4.5, 7.8 };

	int i = 0;
	int size = sizeof(arr) / sizeof(arr[0]);
	//qsort(arr, size, sizeof(int), cmp_int);
	qsort(arr, size, sizeof(double), cmp_double);
	system("pause");
	return 0;
}

#include<stdio.h>//(1)整形冒泡排序
#include<windows.h>
#include<assert.h>
int cmp_int(void *x, void *y)
{
	int *_x = (int*)x;
	int *_y = (int*)y;
	if (*_x > *_y)
	{
		return 1;
	}
	else if (*_x < *_y)
	{
		return -1;
	}
	else
	{
		return 0;
	}
}
//int cmp_string(void *s1, void *s2)
//{/*
//	int *_x = (int*)x;
//	int *_y = (int*)y;*/
//	if (strcmp(*(char **)s1, *(char **)s2))//比较字符串
//	{
//		;
//	}
//	//return 0;
//}
void swap(char *x, char *y, int size)
{
	int i = 0;
	//while (size--)//(1)
	//{
	//	*x ^= *y;
	//	*y ^= *x;
	//	*x ^= *y;
	//	x++, y++;
	//}
	for (i = 0; i < size; i++)//(2)
	{
		char tmp = *((char *)x + i);
		*((char *)x + i) = *((char *)y + i);
		*((char *)y + i) = tmp;
	}
}
void bubble(void *base, int count, int size, int(*cmp)(void *, void *))
{
	assert(base);
	assert(cmp);
	int i = 0;
	int j = 0;
	int flag = 0;
	for (i = 0; i < count - 1; i++)
	{
		for (j = 0; j < count - 1 - i; j++)
		{
			flag = 1;
			if (cmp((char *)base + j*size, (char *)base + (j + 1)*size)>0)//
			{
				swap((char *)base + j*size, (char *)base + (j + 1)*size, size);//按字节进行交换

			}
		}
		if (flag == 0)
		{
			break;
		}
	}
}
int main()
{
	    int arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8 };
		int i = 0;
		//char *arr[] = { "aaa", "ddd", "bbb", "ccc" };
		int size = sizeof(arr) / sizeof(arr[0]);
		bubble(arr, size, sizeof(int), cmp_int);
		//bubble(arr, size, sizeof(char*), cmp_string);
		for (i = 0; i < size; i++)
		{
			printf("%d ", arr[i]);
			//printf("%s  ", arr[i]);
		}
		printf("\n");
		system("pause");
		return 0;
}
int cmp_string(void *s1, void *s2)//(2)字符串比较冒泡排序
{/*
	int *_x = (int*)x;
	int *_y = (int*)y;*/
	if (strcmp(*(char **)s1, *(char **)s2))//比较字符串
	{
		;
	}
	//return 0;
}
void swap(char *x, char *y, int size)
{
	int i = 0;
	//while (size--)//(1)
	//{
	//	*x ^= *y;
	//	*y ^= *x;
	//	*x ^= *y;
	//	x++, y++;
	//}
	for (i = 0; i < size; i++)//(2)
	{
		char tmp = *((char *)x + i);
		*((char *)x + i) = *((char *)y + i);
		*((char *)y + i) = tmp;
	}
}
void bubble(void *base, int count, int size, int(*cmp)(void *, void *))
{
	assert(base);
	assert(cmp);
	int i = 0;
	int j = 0;
	int flag = 0;
	for (i = 0; i < count - 1; i++)
	{
		for (j = 0; j < count - 1 - i; j++)
		{
			flag = 1;
			if (cmp((char *)base + j*size, (char *)base + (j + 1)*size)>0)//
			{
				swap((char *)base + j*size, (char *)base + (j + 1)*size, size);//按字节进行交换

			}
		}
		if (flag == 0)
		{
			break;
		}
	}
}
int main()
{
	    //int arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8 };
		int i = 0;
		char *arr[] = { "aaa", "ddd", "bbb", "ccc" };
		int size = sizeof(arr) / sizeof(arr[0]);
		//bubble(arr, size, sizeof(int), cmp_int);
		bubble(arr, size, sizeof(char*), cmp_string);
		for (i = 0; i < size; i++)
		{
			//printf("%d ", arr[i]);
			printf("%s  ", arr[i]);
		}
		printf("\n");
		system("pause");
		return 0;
}


 
 




猜你喜欢

转载自blog.csdn.net/na_hanqiannan/article/details/80394881
今日推荐