美文网首页
OC 中实现常用的算法

OC 中实现常用的算法

作者: yanhaiqiang | 来源:发表于2017-06-05 15:14 被阅读0次

    #在OC中实现常用的算法(冒泡,选择,快速,插入)

    ## 1.冒泡排序

    - (void)viewDidLoad {

    [super viewDidLoad];

    //OC中常用的一些排序

    NSArray *arr = @[@"1",@"2",@"5",@"3",@"6",@"9",@"5",];

    NSMutableArray *oldArr = [NSMutableArray arrayWithArray:arr];

    NSLog(@"%@",oldArr);

    [self bubbleSort:oldArr];

    [self selectionSort:oldArr];

    [self insertSor:oldArr];

    [self quickSort:oldArr leftIndex:1 rightIndex:5];

    }

    #pragma mark - bubbleSort

    /**

    ①.冒泡排序算法

    @param array参数

    */

    - (void)bubbleSort:(NSMutableArray *)array {

    for (int i = 0; i < array.count; i++) {

    for (int j = 0; j < array.count-i-1; j++) {

    if ([array[j+1]integerValue] < [array[j]integerValue]) {

    int temp = [array[j] integerValue];

    array[j] = array[j+1];

    array[j+1] = [NSNumber numberWithInt:temp];

                        }

                }  

        }

    NSLog(@"冒泡排序后: %@",array);

    }

    #pragma mark - selectionSort

    /**

    ②.选择排序

    @param array参数

    */

    - (void)selectionSort:(NSMutableArray *)array {

    for (int i = 0; i < array.count; i++) {

    for (int j = i+1; j

    if ([array[i]integerValue] > [array[j]integerValue]) {

    int temp = [array[i] integerValue];

    array[i] = array[j];

    array[j] = [NSNumber numberWithInt:temp];

                    }

              }

      }

    NSLog(@"选择排序后: %@",array);

    }

    #pragma mark - insertSort

    /**

    ③.插入排序

    @param array参数

    */

    - (void)insertSor:(NSMutableArray *)array {

    for (int i = 1; i < array.count; i++) {

    int temp = [array[i]integerValue];

    for (int j = i-1; j>=0 && temp <[array[j] integerValue]; j--) {

    array[j+1] = array[j];

    array[j] = [NSNumber numberWithInt:temp];

                 }

         }

    NSLog(@"插入排序后: %@",array);

    }

    #pragma mark - quickSort

    /**

    ④.快速排序

    @param array参数

    */

    - (void)quickSort:(NSMutableArray *)array leftIndex:(int)left rightIndex:(int)right {

    if (left < right) {

    int temp = [self getMiddleIndex:array leftIndex:left rightIndex:right];

    [self quickSort:array leftIndex:left rightIndex:temp-1];

    [self quickSort:array leftIndex:temp+1 rightIndex:right];

        }

    NSLog(@"快速排序后: %@",array);

    }

    - (int)getMiddleIndex:(NSMutableArray *)array leftIndex:(int)left rightIndex:(int)right {

    int tempValue = [array[left] integerValue];

    while (left < right) {

    while (left < right && tempValue <= [array[right] integerValue]) {

    right--;

        }

    if (left < right) {

    array[left]=array[right];

       }

    while (left < right && [array[left] integerValue] <= tempValue) {

    left++;

       }

    if (left < right) {

    array[left] = array[right];

       }

       }

    array[left] = [NSNumber numberWithInt:tempValue];

    return left;

    }

    @end

    相关文章

      网友评论

          本文标题:OC 中实现常用的算法

          本文链接:https://www.haomeiwen.com/subject/kbwifxtx.html