选择排序
NSMutableArray *dataArray = [NSMutableArray arrayWithObjects:@1,@10,@4,@9,@7,@3,@8,@5,@6,@2,nil];
for (int i=0; i<dataArray.count; i++) {
for (int j=i+1; j<dataArray.count; j++) {
if (dataArray[i]<dataArray[j]) {
[dataArray exchangeObjectAtIndex:i withObjectAtIndex:j];
}
}
}
冒泡排序
NSMutableArray *dataArray = [NSMutableArray arrayWithObjects:@1,@10,@4,@9,@7,@3,@8,@5,@6,@2,nil];
for (int i=0; i<dataArray.count; i++) {
for (int j=0; j<dataArray.count-1; j++) {
if (dataArray[j]<dataArray[j+1]) {
[dataArray exchangeObjectAtIndex:j withObjectAtIndex:j+1];
}
}
}
C语言选择排序
int arr[10] = {0,2,1,3,9,8,6,7,5,4};
int length;
length=sizeof(arr)/sizeof(arr[0]);
for (int i = 0; i<length; i++) {
for (int j = i+1; j<length; j++) {
if (arr[i]<arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int r=0; r<length; r++) printf("%d ",arr[r]);
C语言冒泡排序
int arr[10] = {0,2,1,3,9,8,6,7,5,4};
int length;
length=sizeof(arr)/sizeof(arr[0]);
for (int i = 0; i<length-1; i++) {
for (int j = 0; j<length-1-i; j++) {
if (arr[j]<arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
for (int r=0; r<length; r++) printf("%d ",arr[r]);