C语言冒泡排序

#include 
void main()
{
	int count_ = 0;
	int a[10] = { 4,7,3,6,9,2,5,1,10,8 };
	for (int i = 0; i &lt; 10; i++)
		for (int j = i + 1; j &lt; 10; j++) { if (a[i] &gt; a[j])
			{
				int t = a[i];
				a[i] = a[j];
				a[j] = t;
			}
			count_++;
		}
	
	printf("\n排序后的数组为:\n\n");
	for (int i = 0; i &lt; 10; i++)
		printf("%d ", a[i]);
	printf("\n");
	printf("\nfor循环的循环次数为: %d\n\n",count_);
	system("pause");
	exit(0);
}

#include

void main()

{

int count_ = 0;

int a[10] = { 4,7,3,6,9,2,5,1,10,8 };

for (int i = 0; i < 10; i++)

for (int j = i + 1; j < 10; j++) { if (a[i] > a[j])

{

int t = a[i];

a[i] = a[j];

a[j] = t;

}

count_++;

}

printf("\n排序后的数组为:\n\n");

for (int i = 0; i < 10; i++)

printf("%d ", a[i]);

printf("\n");

printf("\nfor循环的循环次数为: %d\n\n",count_);

system("pause");

exit(0);

}

代码下载：BubbleSort.c

Published by Lucian Liu

发表回复取消回复

Published by Lucian Liu

发表回复 取消回复

发表回复取消回复