选择排序就是每一轮选出最小者交换到左侧的思路,或者选出最大这交换到最右侧的思路
这种排序的最大优势就是省去多余的元素交换
OC代码:
- (NSArray *)selectSort:(NSArray *)sort
{
NSMutableArray *array = [NSMutableArray arrayWithArray:sort];
for (int i =0; i < array.count -1; i++) {
int minIndex = i;
for (int j = i+1; j < array.count; j++) {
if([array[minIndex] intValue] > [array[j] intValue]){
minIndex = j;
}
}
if (minIndex != i ) {
[array exchangeObjectAtIndex:i withObjectAtIndex:minIndex];
}
}
return [NSArray arrayWithArray:array];
}
- (void)viewDidLoad {
[super viewDidLoad];
NSArray *array = @[@3,@4,@5,@7,@9,@10,@2,@(-11),@8,@13,@1];
NSArray *list = [self selectSort:array];
NSLog(@"list = %@",list);
}
打印结果:list = (
"-11",
1,
2,
3,
4,
5,
7,
8,
9,
10,
13
)
java代码:
public static void selectionSort(int[] array){
for(int i =0; i<array.length -1; i++){
int minIndex = 1;
for (int j = i +1; j < array.length; j++) {
minIndex = array[minIndex] < array[j] ? minIndex : j;
}
int temp = array[i];
array[i] = array[minIndex];
array[minIndex] = temp;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] array = new int[]{3,4,2,1,5,6,7,30,50,-4,7,0};
selectionSort(array);
System.out.println(Arrays.toString(array));
}
时间复杂度为O(n^2) 空间复杂度O(1)