美文网首页算法程序员
递归-4数组逆序

递归-4数组逆序

作者: 路灯下的黑猫H | 来源:发表于2017-03-16 15:33 被阅读0次

    //

    //ViewController.m

    //CocoTest_1

    //

    //Created by S u p e r m a n on 2017/3/14.

    //Copyright © 2017年张浩. All rights reserved.

    //

    #import"ViewController.h"

    - (void)viewDidLoad {

    [superviewDidLoad];

    // Do any additional setup after loading the view, typically from a nib.

    inta[10] = {0,1,2,3,4,5,6,7,8,9};

    inversion(10,a);

    }

    voidinversion(intn,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);

    }

    }

    @end

    相关文章

      网友评论

        本文标题:递归-4数组逆序

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