冒泡排序(Bubble Sort)

int arr[5] = {3, 2, 1, 4, 0};
int temp = 0;
        
for (int i = 0; i < 4; i++) {
    for (int j = 0; j < 4 - i; j++) {
		if (arr[j] > arr[j + 1]) {
			temp = arr[j];
            arr[j] = arr[j + 1];
            arr[j + 1] = temp;
		}
	}
}
        
for (int i = 0; i < 5; i++) {
	printf("%d ", arr[i]);
}
printf("\n");