递归4_数组逆序

最新推荐文章于 2022-11-05 19:31:13 发布

MRLeeCH

最新推荐文章于 2022-11-05 19:31:13 发布

阅读量636

点赞数

分类专栏：算法文章标签：递归

本文链接：https://blog.csdn.net/li1990101010/article/details/51026256

版权

算法专栏收录该内容

12 篇文章 1 订阅

订阅专栏

- (void)viewDidLoad {
    [super viewDidLoad];
    // Do any additional setup after loading the view, typically from a nib.

    int a[10] = {0,1,2,3,4,5,6,7,8,9};
    inversion(10,a);
}

void inversion(int n,int *a){

    if (n == 1) {

        printf("第%d个：%d\n",n,a[n-1]);

    }else {

        printf("第%d个：%d\n",n,a[n-1]);
        inversion(n-1,a);


    }

}