冒泡排序无法将数组排成有序序列

Question

#include
#include
void BuddleSort(int a[], int n);
int main() {
int a[10] = { 7,4,3,2,8,1,0 };
int length = sizeof(a) / sizeof(int);
BuddleSort(a,length);
for (int i = 0; i < length; i++) {
printf("%d", a[i]);
}
}
void BuddleSort(int a[], int n) {
bool exchange;
for (int i = 0; i < n; i++) {
exchange = false;
for (int j = n-1; j > i; j--) {
if (a[j] < a[j - 1]) {
int temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
exchange = true;
}
}
exchange ==false;
return;
}
}
无法正确排序

Answer 1

exchange ==false;
这时要干嘛，判断没有if，赋值应该用 = ，写在这里也不能传入主程序。

return也是多余

正确写法

void BuddleSort(int a[], int n);
int main() {
    int a[] = { 7,4,3,2,8,1,0 };
    int length = sizeof(a) / sizeof(int);
    BuddleSort(a,length);
    for (int i = 0; i < length; i++) {
        printf("%d ", a[i]);
    }
}
void BuddleSort(int a[], int n) {
    for (int i = 0; i < n; i++) {
        for (int j = n-1; j > i; j--) {
            if (a[j] < a[j - 1]) {
                int temp = a[j];
                a[j] = a[j - 1];
                a[j - 1] = temp;
            }
        }
    }
}