c实现功能(1)冒泡排序

#include <stdio.h>

int main() {
	int array[10] = { 0,5,3,2,4,1,6,9,8,7 };

	for (int i = 0; i < 10; i++)
	{
		for (int j = 0; j < 10 - 1 - i; j++)  //减1是为了防止数组越界 
		{
			if (array[j] > array[j + 1]) {
				int temp = array[j + 1];
				array[j + 1] = array[j];
				array[j] = temp;
			}
		}
	}

	for (int i = 0; i < 10; i++)
	{
		printf("%d\n", array[i]);
	}

	return 0;
}

猜你喜欢

转载自blog.csdn.net/hc1151310108/article/details/82861790