oc实现快速排序

算法的原理参考这篇文章 http://developer.51cto.com/art/201403/430986.htm

快速排序，简单来说，就是找一个基准，一般是数组第一个数A，然后经过调整后使得A前面的值小于等于A，A后面的值大于等于A。然后把A前面的序列当成一个数组，后面的序列也当成一个数组重复前面的操作。在原文提到一个问题为什么要从最右边开始，我思考后觉得是因为j要找的是比A小的，i是找比A大的，如果是从i开始，经过几次交换后，可能没找到比A大的就i＝j了，而由于前一次ij位置值交换，现在j位置的数是大于A的，然后把A和i＝j的位置交换，现在明显就不对了。

像6  1  2 5  4  3  9  7 10  8 如果i开始那就到i＝j 此时i位置上是9，和6互换，明显不对了。

应该优先找比A小的，相反如果基准是最右边，那就应该优先找比A大的了。

//
//  Sort.m
//  TestMain
//
//  Created by huangymu on 15-7-2.
//  Copyright (c) 2015年 huangymu. All rights reserved.
//

#import "Sort.h"

@implementation Sort
-(void)sort:(NSMutableArray*)array{
    [self sort:array left:0 right:array.count-1];
}
-(void)sort:(NSMutableArray*)array left:(NSInteger)left right:(NSInteger)right{
    if(left >= right){
        return;
    }
    NSInteger start = left;
    NSInteger end = right;
    id tmp = [array objectAtIndex:left];
    while (left < right) {
        while (left < right &&[array objectAtIndex:right]>=tmp) {
            right--;
        }
        while (left < right &&[array objectAtIndex:left]<=tmp) {
            left ++;
        }
        if (left<right) {
            id tmp2 = [array objectAtIndex:right];
            [array replaceObjectAtIndex:right withObject:[array objectAtIndex:left]];
            [array replaceObjectAtIndex:left withObject:tmp2];
        }
    }
    id tmp3 = [array objectAtIndex:left];
    [array replaceObjectAtIndex:left withObject:tmp];
    [array replaceObjectAtIndex:start withObject:tmp3];
    [self sort:array left:start right:left];
    [self sort:array left:left+1 right:end];
}

@end

测试

//
//  main.m
//  TestMain
//
//  Created by huangymu on 15-7-2.
//  Copyright (c) 2015年 huangymu. All rights reserved.
//

#import <Foundation/Foundation.h>
#import "Sort.h"
int main(int argc, const char * argv[]) {
    @autoreleasepool {
        // insert code here...
        NSMutableArray *data = [NSMutableArray array];
        for (int i =0;i<10;i++) {
                    u_int32_t x = arc4random() % 100;//0~kMax
                    NSNumber *num = [[NSNumber alloc] initWithInt:x];
                    [data addObject:num];
                    [num release];
            }
        for(NSNumber *number in data){
            NSLog(@"%@",number);
        }
        NSLog(@"after");
        Sort *s = [[[Sort alloc]init]autorelease ];
        [s sort:data];
        for(NSNumber *number in data){
            NSLog(@"%@",number);
        }
    }
    return 0;
}

layout：
2015-07-03 09:20:41.556 TestMain[4382:303] 13
2015-07-03 09:20:41.557 TestMain[4382:303] 0
2015-07-03 09:20:41.558 TestMain[4382:303] 71
2015-07-03 09:20:41.559 TestMain[4382:303] 7
2015-07-03 09:20:41.559 TestMain[4382:303] 44
2015-07-03 09:20:41.560 TestMain[4382:303] 85
2015-07-03 09:20:41.561 TestMain[4382:303] 52
2015-07-03 09:20:41.562 TestMain[4382:303] 8
2015-07-03 09:20:41.562 TestMain[4382:303] 73
2015-07-03 09:20:41.563 TestMain[4382:303] 95
2015-07-03 09:20:41.564 TestMain[4382:303] after
2015-07-03 09:20:41.564 TestMain[4382:303] 0
2015-07-03 09:20:41.565 TestMain[4382:303] 7
2015-07-03 09:20:41.566 TestMain[4382:303] 8
2015-07-03 09:20:41.566 TestMain[4382:303] 13
2015-07-03 09:20:41.567 TestMain[4382:303] 44
2015-07-03 09:20:41.567 TestMain[4382:303] 52
2015-07-03 09:20:41.568 TestMain[4382:303] 71
2015-07-03 09:20:41.568 TestMain[4382:303] 73
2015-07-03 09:20:41.570 TestMain[4382:303] 85
2015-07-03 09:20:41.570 TestMain[4382:303] 95
Program ended with exit code: 0