冒泡排序

#include <stdio.h>

int main() {
	int arr[10] = {2,4,6,8,1,3,5,7,9,0};
	int len = sizeof(arr)/sizeof(arr[0]);
	// bubble sort
	for (int i = 1; i < len; i++) {
    // int flag = 0;
		for (int j = 0; j < len - i; j++) {
			if (arr[j] > arr[j+1]) {
				int temp = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = temp;
        // flag = 1;
			}
		}
    // if (0 == flag) break;
	}
	for (int i = 0; i < len; i++) {
		printf("%d ", arr[i]);
	}
	printf("\n");
	return 0;
}