冒泡排序

#import <Foundation/Foundation.h>//大数下沉void sort(int arry[], int length){    int t = 0;    for (int i = 0; i < length - 1; i++) {// -1是因为最后一个不需要比较了        for (int j = 0; j < length - 1 - i; j++) {            if (arry[j] > arry[j + 1]) {                t = arry[j];                arry[j] = arry[j + 1];                arry[j + 1] = t;            }        }            }    }int main(int argc, const char * argv[]) {    //冒泡排序法    //定义一个数组    int a[20];    int num = 0;        for (int i = 0; i < 20; i++) {        num = arc4random() % 21 + 20;        a[i] = num;        printf("%d ", a[i]);    }    printf("\n");            //调用函数    sort ( a, 20);    //遍历数组    for (int i = 0; i < 20; i++) {        printf("%d ", a[i]);            }    printf("\n");                                    return 0;}