冒泡排序 C

#include<stdio.h>
void printArray(int array[], int length) {
	for (int i = 0; i < length; i++) {
		printf("%d ", array[i]);
	}
	printf("\n");
}
void  bubbleSort(int*array,int length) {
	for (int i = 0; i < length-1; i++)
	{
		for (int j = 0; j < length-1-i; j++)
		{
			if (array[j]>array[j+1])
			{
				int temp = array[j+1];
				array[j+1] = array[j];
				array[j] = temp;
			}
		}
	}
	printArray(array, length);
}
int main()
{
	int array[8] = { 49, 38, 65, 97, 76, 13, 27, 49 };
	printArray(array, 8);
	printf("\n");
	bubbleSort(array, 8);
	return 0;
}

参考：

分类: Data Structure | tyrantlucifer