数组：冒泡排序改进

#include<stdio.h>
void bubble_sort(int arr[], int sz) {
	int tmp = 0;
	for (int i = 0; i < sz-1; i++) {
		int flag = 1;//假设已经有序
		for (int j = 0; j < sz - 1 - i; j++) {
			if (arr[j] > arr[j + 1]) {
				tmp=arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
				flag = 0;
				
			}
		}
		if (flag == 1) {
			break;
		}
	}
}


int main() {
	int arr[] = { 9,4,6,3,2,5,11,34,56 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	bubble_sort(arr, sz);
	for (int i = 0; i < sz; i++) {
		printf("%d ", arr[i]);
	}
	return 0;
}