冒泡排序与qsort

冒泡

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

void BubbleSort(int *array)
{
	int i, j,t;
	for (i = 0; i < 9; i++)
	{
		for (j = 0; j < 9 - i; j++)
		{
			if (array[j] > array[j + 1])
			{
				t = array[j];
				array[j] = array[j + 1];
				array[j + 1] = t;
			}
		}
	}
}
int main()
{
	int i;
	int a[10] = { 12,23,43,65,212,454,67,87,45,32 };
	BubbleSort(a);
	for (i = 0; i < 10; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	system("pause");
	return 0;
}

qsort

#include<stdio.h>
#include<windows.h>
#include<stdlib.h>
#pragma warning(disable:4996)

int int_cmp(const void*s1, const void* s2)//对整形进行排序
{
	return *(int*)s1 > *(int*)s2;
}
int char_cmp(const void*s1, const void* s2)//对字符进行排序
{
	return *(char*)s1 > *(char*)s2;
}
int str_cmp(const void*s1, const void*s2)//对字符串进行排序
{
	return strcmp((char*)s1, (char*)s2);
}
void swap(void*p, void* q, int count)
{
	for (int i = 0; i < count; i++)
	{
		char temp = *((char*)p + i);
		*((char*)p + i) = *((char*)q + i);
		*((char*)q + i) = temp;
	}
}
void my_qsort(void*base, int count, int size, int(*str_cmp)(void*p, void*q))
{
	int i = 0;
	int j = 0;
	for (i = 0; i < count - 1; i++)
	{
		for (j = 0; j < count - 1 - i; j++)
		{
			if (str_cmp((char*)base + j*size, (char*)base + (j + 1)*size)>0)
			{
				swap(((char*)base + j*size), ((char*)base + (j + 1)*size), size);
			}
		}
	}
}
void qint_cmp()
{
	int arr1[] = { 1,3,5,7,9,2,4,6,8,0 };
	my_qsort(arr1, sizeof(arr1) / sizeof(arr1[0]), sizeof(int), int_cmp);
	for (int i = 0; i < sizeof(arr1) / sizeof(arr1[0]); i++)
	{
		printf("%d ", arr1[i]);
	}
	printf("\n");
}
void qchar_cmp()
{
	char arr2[] = { 'e','d','c','b','a','f' };
	my_qsort(arr2, sizeof(arr2) / sizeof(arr2[0]), sizeof(char), char_cmp);
	for (int i = 0; i < sizeof(arr2) / sizeof(arr2[0]); i++)
	{
		printf("%c ", arr2[i]);
	}
	printf("\n");
}
void qstr_cmp()
{
	char arr3[5][5] = { "bcbb","dwdd","cvcc","aaac","aaab" };
	my_qsort(arr3, 5, sizeof(arr3[0]), str_cmp);
	for (int i = 0; i < 5; i++)
	{
		printf("%s ", arr3[i]);
	}
	printf("\n");
}
int main()
{
	int choice;
	while(1)
	{
	printf("please choose:");
	scanf("%d", &choice);
		switch (choice)
		{
		case 1:
			qint_cmp();
			break;
		case 2:
			qchar_cmp();
			break;
		case 3:
			qstr_cmp();
			break;
		default:
			printf("error!\n");
			break;
		}
	}
	system("pause");
	return 0;
}



 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值