C++ 冒泡排序

最新推荐文章于 2024-05-02 20:30:24 发布

努力努力学习中

最新推荐文章于 2024-05-02 20:30:24 发布

阅读量407

点赞数

分类专栏： C++ 文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/zhaoyuqings/article/details/127900233

版权

C++ 专栏收录该内容

8 篇文章 1 订阅

订阅专栏

void PAIXU(int rr[],int length)
{
	for (int i = 0; i < length; i++)
	{
		for (int j = i; j < length-1; j++)
		{
			if (rr[i] < rr[j + 1])
			{
				int temp = rr[j + 1];

				rr[j + 1] = rr[i];
				rr[i] = temp;
			}
		}
	}
}


int main()
{
	int a5[] = {18,29,578,20,45,55,36};
	for (int i = 0; i < sizeof(a5)/sizeof(a5[0]); i++)
	{
		printf("%d ", a5[i]);
	}
	printf("\n");
	PAIXU(a5, sizeof(a5) / sizeof(a5[0]));
	for (int x = 0; x < sizeof(a5) / sizeof(a5[0]); x++)
	{
		printf("%d ",a5[x]);
	}
	printf("\n");

	while (1)
	{
		sleep(1);
	}
	return 1;
}