從小到大排序

1.用OC外層封裝的方法

-(NSArray *)combine:(NSArray * )array count:(NSInteger)count{
    int arr[array.count];
    for (int i = 0; i < array.count; i++)
    {
        arr[i] = [array[i] intValue];
    }
    int num = count;
    int result[num];
    
    return combine_increase(arr, 0, result, num, num, sizeof(arr)/sizeof(int));
}

2.用C語言和OC混編實現(xiàn)的方法钉稍，直接把結(jié)果返回

//arr為原始數(shù)組
//start為遍歷起始位置
//result保存結(jié)果兰珍，為一維數(shù)組
//count為result數(shù)組的索引值潮尝，起輔助作用
//NUM為要選取的元素個數(shù)
//arr_len為原始數(shù)組的長度吻氧，為定值
NSArray * combine_increase(int* arr, int start, int* result, int count, const int NUM, const int arr_len)
{
    NSMutableArray * resultArr = [NSMutableArray array];
    int i = 0;
    for (i = start; i < arr_len + 1 - count; i++)
    {
        result[count - 1] = i;
        if (count - 1 == 0)
        {
            int j;
            NSMutableArray * subArr = [[NSMutableArray alloc]init];
            for (j = NUM - 1; j >= 0; j--){
                [subArr addObject:[NSNumber numberWithInt:arr[result[j]]]];
//                printf("%d\t",arr[result[j]]);
            }
            [resultArr addObject:subArr];
//            printf("\n");
        }
        else
         [resultArr addObjectsFromArray:combine_increase(arr, i + 1, result, count - 1, NUM, arr_len)];
    }
    return resultArr;
}

3.純C語言實現(xiàn)

//arr為原始數(shù)組
//start為遍歷起始位置
//result保存結(jié)果椿疗，為一維數(shù)組
//count為result數(shù)組的索引值宙址，起輔助作用
//NUM為要選取的元素個數(shù)
//arr_len為原始數(shù)組的長度睛廊，為定值
void combine_increase(int* arr, int start, int* result, int count, const int NUM, const int arr_len)
{
    int i = 0;
    for (i = start; i < arr_len + 1 - count; i++)
    {
        result[count - 1] = i;
        if (count - 1 == 0)
        {
            int j;
            for (j = NUM - 1; j >= 0; j--)
                printf("%d\t",arr[result[j]]);
            printf("\n");
        }
        else
            combine_increase(arr, i + 1, result, count - 1, NUM, arr_len);
    }
}

從大到小排序

1.用OC外層封裝的方法

-(NSArray *)combine2:(NSArray * )array count:(int)count{
    int arr[array.count];
    int i;
    for (i = 0; i < array.count; i++)
    {
        arr[i] = [array[i] intValue];
    }
    int result[count];
    
    return combine_decrease(arr,i, result, count, count);
}

2.用C語言和OC混編實現(xiàn)的方法，直接把結(jié)果返回

//arr為原始數(shù)組
//start為遍歷起始位置
//result保存結(jié)果旭咽，為一維數(shù)組
//count為result數(shù)組的索引值贞奋，起輔助作用
//NUM為要選取的元素個數(shù)
NSArray * combine_decrease(int* arr, int start, int* result, int count, const int NUM)
{
    NSMutableArray * resultArr = [NSMutableArray array];
    int i;
    for (i = start; i >=count; i--)
    {
        result[count - 1] = i - 1;
        if (count > 1)
        {
            [resultArr addObjectsFromArray:combine_decrease(arr, i - 1, result, count - 1, NUM)];
        }
        else
        {
            int j;
            NSMutableArray * subArr = [[NSMutableArray alloc]init];
            for (j = NUM - 1; j >=0; j--){
                [subArr addObject:[NSNumber numberWithInt:arr[result[j]]]];
//                printf("%d\t",arr[result[j]]);
            }
            [resultArr addObject:subArr];
//            printf("\n");
        }
    }
    return resultArr;
}

3.純C語言實現(xiàn)

//arr為原始數(shù)組
//start為遍歷起始位置
//result保存結(jié)果，為一維數(shù)組
//count為result數(shù)組的索引值穷绵，起輔助作用
//NUM為要選取的元素個數(shù)
void combine_decrease(int* arr, int start, int* result, int count, const int NUM)
{
  int i;
  for (i = start; i >=count; i--)
  {
    result[count - 1] = i - 1;
    if (count > 1)
    {
      combine_decrease(arr, i - 1, result, count - 1, NUM);
    }
    else
    {
      int j;
      for (j = NUM - 1; j >=0; j--)
    printf("%d\t",arr[result[j]]);
      printf("\n");
    }
  }
}