选择排序法

#import <Foundation/Foundation.h>
//选择排序
void selectsort(int arry[], int length){
for (int i = 0; i < length - 1; i++) {
for (int j = i + 1; j < length; j++) {
if (arry[i] > arry[j]) {
int t = arry[i];
arry[i] = arry[j];
arry[j] = t;
}
}

}

}

int main(int argc, const char * argv[]) {
int a[5] = {1111, 222, 453, 888, 23};
selectsort (a, 5);
//遍历数组
for (int i = 0; i < 5; i++) {
printf("%d ", a[i]);
}
printf("\n");

return 0;
}