【C】80.利用qsort进行各种数据类型的排序

利用qsort进行各种数据类型的排序
其头文件是stdlib.h

对整形数组进行排序

int cmp_int(const void* e1, const void* e2) {
	return *(int*)e1 - *(int*)e2;
}
int main() {
	int arr[10] = { 2,1,4,3,9,5,6,8,7,0 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	qsort(arr, sz, sizeof(arr[0]), cmp_int);
	int i = 0;
	for (i = 0; i < sz; i++) {
		printf("%d ", arr[i]);
	}
	return 0;
}

对浮点型数组进行排序

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

int cmp_float(const void* e1, const void* e2) {
	return ((int)(*(float *)e1 - *(float *)e2));
}
int main() {
	float arr[5] = { 2.0,7.0,3.0,4.0,9.0 };
	int sz = sizeof(arr) / (sizeof(arr[0]));
	qsort(arr, sz, sizeof(arr[0]), cmp_float);
	int i = 0;
	for (i = 0; i < sz; i++) {
		printf("%f ", arr[i]);
	}
	return 0;
}

比较结构体里的int类型值

#include <stdlib.h>
#include <stdio.h>
struct Stu {
	char name[20];
	int age;
};

int cmp_stu_by_age(const void* e1, const void* e2) {
	return ((struct Stu*)e1)->age - ((struct Stu*)e2)->age;
}
int main() {
	struct Stu s[3] = { {"zhangsan",30},{"lisi",10},{"wangmali",20} };
	int sz = sizeof(s) / sizeof(s[0]);
	qsort(s, sz, sizeof(s[0]), cmp_stu_by_age);

	return 0;
}

比较结构体里的char类型值

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

struct Stu {
	char name[20];
	int age;
};
int cmp_stu_by_name(const void* e1, const void* e2) {
	return strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
int main() {
	struct Stu s[3] = { {"zhangsan",30},{"lisi",10},{"wangmali",20} };
	int sz = sizeof(s) / sizeof(s[0]);
	qsort(s, sz, sizeof(s[0]), cmp_stu_by_name);
	return 0;
}

利用冒泡排序的性质来编写和qsort功能相同的函数

int cmp_stu_by_name(const void* e1, const void* e2) {
	return strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
int cmp_stu_by_age(const void* e1, const void* e2) {
	return ((struct Stu*)e1)->age - ((struct Stu*)e2)->age;
}
int cmp_int(const void* e1, const void* e2) {
	return *(int*)e1 - *(int*)e2;
}
int cmp_float(const void* e1, const void* e2) {
	return ((int)(*(float *)e1 - *(float *)e2));
}

void swap(char*bf1, char*bf2,int width) {
	int i = 0;
	for (i = 0; i < width; i++) {
		char temp = *bf1;
		*bf1 = *bf2;
		*bf2 = temp;
		bf1++;
		bf2++;
	}
}
void sort(void* base, int sz, int width, int(*cmp)(const void* e1, const void* e2)) {
	int i = 0;
	char* temp;
	//趟数
	for (i = 0; i < sz; i++) {
		//每一趟比较的对数
		int j = 0;
		for (j = 0; j < sz - 1 - i; j++) {
			//两个元素进行比较
			if (cmp((char*)base + j * width, (char*)base + (j + 1) * width)>0) {
				swap((char*)base + j * width, (char*)base + (j + 1) * width,width);
			}
		}
	}
}
int main() {
	//float arr[10] = { 9.0,8.0,7.0,6.0,5.0,4.0,3.0,2.0,1.0,0.0 };
	struct Stu s[3] = { {"zhangsan",30},{"lisi",10},{"wangmali",20} };
	int sz = sizeof(s) / sizeof(s[0]);
	sort(s,sz,sizeof(s[0]), cmp_stu_by_name);
	return 0;
}