冒泡排序1

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

void swap(int* numl, int* num2) {
	int temp = *numl;
	*numl = *num2;
	*num2 = temp;
}

void BubbleSort(int arr[], int len) {
	for (int i = 0; i < len - 1; i++) {
		bool sorted = true;
		for (int j = 0; j < len - 1 - i; j++) {
			if (arr[j] > arr[j + 1]) {
				swap(&arr[j], &arr[j + 1]);
				sorted = false;
			}
		}
		if (sorted) break;//记得要放在外面循环里
	}
}

int main() {
	int beauties[] = { 163,161,158,165,171,170,163,159 };

	int len = sizeof(beauties) / sizeof(beauties[0]);//得到数组的长度，容量除以每个元素所占的空间
	BubbleSort(beauties, len);
	
		printf("美女排序以后的结果是：\n");
		for (int i = 0; i < len; i++) {
			printf("%d\n", beauties[i]);
	}
	system("pause");
	return 0;

}