简单冒泡排序

void swap(int *pa, int *pb) {
int temp = *pa;
*pa = *pb;
*pb = temp;
}

void bubbleSort(int A[], int n) {
bool sorted = false;
while (!sorted) {
sorted = true;
for (int i = 1; i < n; i++) {
if (A[i - 1] > A[i]) {
swap(&A[i - 1], &A[i]);
}
sorted = false;
}
n–;
}

}
int main(int argc, const char * argv[]) {
@autoreleasepool {
// insert code here…
NSLog(@”Hello, World!”);
int a[] = {8, 9, 3, 4, 2, 1, 0};
bubbleSort(a, sizeof(a) / sizeof(a[0]));
for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) {
NSLog(@”%d:%d\n”, i, a[i]);
}
}
return 0;
}