C语言对冒泡排序进行升级介绍

 
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
 
//实现q_sort函数用冒泡排序
 
//只能排序整型
//void bubbling_sort(int *arr, int se)
//{
//	int i = 0;
//	int j = 0;
//	for (i = 0; i < se - 1; i++)
//	{
//		for (j = 0; j < se - 1 - i; j++)
//		{
//			//升序排列
//			if (arr[j] > arr[j + 1])
//			{
//				int tem = arr[j];
//				arr[j] = arr[j + 1];
//				arr[j + 1] = tem;
//			}
//		}
//	}
//}
 
struct Stu
{
	char name[20];
	int age;
	float score;
};
 
//打印排序后结果
void print_arr_int(int* arr, int se)
{
	int i = 0;
	for (i = 0; i < se ; i++)
	{
		printf("%d ", *(arr + i));
	}
}
void print_arr_float(float* arr, int se)
{
	int i = 0;
	for (i = 0; i < se; i++)
	{
		printf("%.2f ", *(arr + i));
	}
}
void printf_stu(struct Stu arr[], int se)
{
	int i = 0;
	for (i = 0; i < se; i++)
	{
		printf("%s %d %.2f\n", arr[i].name, arr[i].age, arr[i].score);
	}
	printf("\n");
}
 
void swap(char *num1, char *num2, int width)
{
	int i = 0;
	for (i = 0; i < width; i++)
	{
		char tem = *num1;
		*num1 = *num2;
		*num2 = tem;
		num1++;
		num2++;
	}
}
 
void my_sort(void *arr, int se, int width, int (*comp)(const void* e1, const void* e2))
{
 
	int i = 0;
	int j = 0;
	for (i = 0; i < se - 1; i++)
	{
		for (j = 0; j < se - 1 - i; j++)
		{
			//升序排列 
			if (comp((char*)arr + j * width, (char*)arr + (j + 1) * width) > 0)
			{
				//交换数组元素
				swap((char*)arr + j * width, (char*)arr + (j + 1) * width, width);
			}
		}
	}
	
}
 
int comp_int(const void* e1,const void* e2)
{
	return (*(int*)e1)-(*(int*)e2);
}
 
int comp_float(const void* e1, const void* e2)
{
	if ((*(float*)e1) - (*(float*)e2) > 0)
	{
		return 1;
	}
	else if ((*(float*)e1) - (*(float*)e2) < 0)
	{
		return -1;
	}
	else
	{
		return 0;
	}
}
 
int comp_stu_name(const void* e1, const void* e2)
{
	return strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
 
 
int main()
{
 
	int arr[] = {9,8,7,6,5,4,3,2,1,0};
	//float arr[] = { 9.1f, 5.1f, 45.0f, 1.2f, 11.3f };
	//struct Stu arr[] = { {"zhangsan",18,99.2f},{"lisi",28,78.2f},{"wangwu",12,60.5f}};
	int se = sizeof(arr) / sizeof(arr[0]);
 
	my_sort(arr, se, sizeof(arr[0]), comp_int);
	//my_sort(arr, se, sizeof(arr[0]), comp_float);
	//my_sort(arr, se, sizeof(arr[0]), comp_stu_name);
 
	print_arr_int(arr,se);
	//print_arr_float(arr,se);
	//printf_stu(arr, se);
 
	return 0;
}