两种排序介绍

最新推荐文章于 2024-03-28 00:29:10 发布

jx-zls

最新推荐文章于 2024-03-28 00:29:10 发布

阅读量192

点赞数 1

分类专栏：数据结构文章标签：排序插入排序选择排序

本文链接：https://blog.csdn.net/jx_zls/article/details/89430994

版权

数据结构专栏收录该内容

14 篇文章 0 订阅

订阅专栏

插入排序

加入数组A中有元素数为5，则排序伪代码为：

   int j =  for 1 to 5
       key = A[j];
        i = j - 1;
        for ;i >= 0 && A[i]>key;i-- {
        A[i+1] = A[i];
        }
        A[i+1] = key;

 NSMutableArray *arr = @[@32, @34, @88, @2, @44].mutableCopy;
     NSInteger key;
     NSInteger i;
    for (NSInteger j = 1; j < arr.count; j++)
    {
      key = [arr[j] integerValue];
      i = j - 1;
      for (; i >= 0 && [arr[i] integerValue] < key;i-- ){
      	arr[i + 1] = arr[i];
      	}
        arr[i+1]= @(key);
    }

选择排序

  NSMutableArray *arr = @[@32, @34, @88, @2, @44].mutableCopy;

    for (int i = 0; i < arr.count - 1; i++) {
        int flag = i;
        for (int j = i; j < arr.count; j++) {
            NSLog(@"%d -- %d -- %d", i, j, flag);
            if ([arr[flag] integerValue] - [arr[j] integerValue] > 0) {
                flag = j;
            }
        }
        NSString * tem;
        tem = arr[flag];
        arr[flag] = arr[i];
        arr[i] = tem;
    }
    NSLog(@"%@", arr);