模仿qsort的功能实现一个通用的冒泡排序。

int cmp(const void* m, const void* n){
	return*(char*)m - *(char*)n;
}

void swap(char* p1, char* p2, int width){
	int i = 0;
	char temp;
	for (; i < width; i++){
		temp = *p1;
		*p1 = *p2;
		*p2 = temp;
		*p1++;
		*p2++;
	}
}

void Qsort(void* base, int size, int width){
	int i = 0;
	int j = 0;
	int ret = 0;
	for (i = 0; i < size; i++){
		j = 0;
		for (j = 0; j < size - i - 1; j++){
			ret = cmp((char*)base + j*width, (char*)base + (j + 1)*width);
			if (ret>0){
				swap((char*)base + j*width, (char*)base + (j + 1)*width, width);
			}
		}
	}
}
int main(){
	int i = 0;
	char a[] = { 2,4,6,1,3 };
	Qsort(a, 5,1);
	for (i = 0; i < 5; i++){
		printf("%d\n", a[i]);
	}
	system("pause");
	return 0;
}

结果是从小到大排列：1 2 3 4 6