【复习】手写数据结构之冒泡排序

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


void swapData(int* a, int* b)
{
	int temp = *a;
	*a = *b;
	*b = temp;
}


void BubbleSort(int* arr, int length)
{
	int flag = 0;
	for (int i = 0; i < length && flag == 0; ++i)
	{
		flag = 1;
		for (int j = length-1 ; j >i ; --j)
		{
			if (arr[j-1] < arr[j])
			{
				flag = 0;
				swapData(&arr[j - 1], &arr[j]);

				for (int ii = 0; ii < length; ++ii)
					printf("%d ", arr[ii]);
				printf("\n");
			}
		}
	}

}


int main()
{
	int arr[8] = { 1, 3, 4, 5, 7, 8, 6, 5 };
	for (int i = 0; i < 8; ++i)
		printf("%d ", arr[i]);
	printf("\n");

	printf("---------排序后-------\n");
	BubbleSort(arr, 8);
	
	for (int i = 0; i < 8; ++i)
		printf("%d ", arr[i]);

	printf("\n");

	system("pause");
	return 0;
}