zoukankan      html  css  js  c++  java
  • 通过阶乘的例子,练习在JavaScript, Scala和ABAP里实现尾递归(Tail Recursion)

    Before we start to research tail recursion, let’s first have a look at the normal recursion.

    A simple factorial implementation by recursion:

    function factorial(n){
      if(n ===1) {
         return 1;
      }
      return n *factorial(n -1);
    }
    

    Let N = 5, see how new stack frame is created for each time of recursive call:

    We have two stack frames now, one stores the context when n = 5, and the topmost one for current calculation: n = 4



    Now since n equals to 1, we stop recursion. The current stack frame ( n = 1 ) will be poped up, the frame under it will be activated and become the topmost frame, with calculated result 1 passed into.





    key note for normal recursion: during recursion, every generated stack frame is needed and could not e destroyed until the final result is calculated. The calculation is actually not started until the recursion reaches the end ( the condition n === 1 fulfills ). If N is a big integer, it will lead to huge number of stack frames and finally the “stack overflow” or “out of memory” is inevitable.

    tail recursion

    Source code below:

    function tailFactorial(n, total) {
    if(n ===1)
        return total;
    return tailFactorial(n -1, n * total);
    }
    function factorial2(n) {
      return tailFactorial(n,1);
    }
    

    There are two biggest differences compared with normal recursion:

    (1) A new internal function tailFactorial is introduced here.

    (2) The calculation is actually now spread within every recursive stack frame. Each frame finishes one part of calculation and pass the current result to the next frame. Once the current stack frame finishes its task, it is actually not needed any more. And thus for example the model browser can then do some optimization on those useless stack frames.

    Observe the stack frame for tail recursion step by step:







    stack popped up:

    When N = 20, the tail recursion has a far better performance than the normal recursion:

    Update 2016-01-11

    Tail recursion implementation via Scala:

    The interesting thing is, after the Scala code is compiled into Java Byte code, compiler will eliminate the recursion automatically:

    Tail Recursion in ABAP

    First this is the normal recursion:

    REPORT zrecursion.
    
    START-OF-SELECTION.
    
      DATA: lv_result TYPE int4.
    
      PERFORM fac USING 6 CHANGING lv_result.
    
      WRITE: / lv_result.
    
    FORM fac USING iv_n TYPE int4 CHANGING cv_result TYPE int4.
      DATA: lv_n TYPE i.
    
      cv_result = lv_n = iv_n.
      lv_n = lv_n - 1.
      IF lv_n > 1.
        PERFORM fac USING lv_n CHANGING cv_result.
      ENDIF.
      IF lv_n = 1.
        cv_result = cv_result * lv_n.
      ELSE.
        cv_result = cv_result * iv_n.
      ENDIF.
    ENDFORM.
    

    And here comes tail recursion version:

    REPORT ztail.
    
    START-OF-SELECTION.
    
      DATA: lv_result TYPE int4.
    
      PERFORM fac USING 5 1 CHANGING lv_result.
    
      WRITE: / lv_result.
    
    FORM fac USING iv_n TYPE int4 iv_acc TYPE int4 CHANGING cv_result TYPE int4.
      DATA: lv_n          TYPE i,
            lv_accumulate TYPE i.
    
      IF iv_n < 1.
        cv_result = 1.
      ELSEIF iv_n = 1.
        cv_result = iv_acc * iv_n.
      ELSEIF iv_n > 1.
        lv_n = iv_n - 1.
        lv_accumulate = iv_acc * iv_n.
        PERFORM fac USING lv_n lv_accumulate CHANGING cv_result.
      ENDIF.
    ENDFORM.
    

    要获取更多Jerry的原创文章,请关注公众号"汪子熙":

  • 相关阅读:
    4星|《激荡十年,水大鱼大》:过去十年间国内商业简史
    4星|《三联生活周刊》2017年47期:所谓“嬉皮精神”,说白了就是让每一个人都能在不影响其他人的前提下,过自己想要的生活
    3星|《三联生活周刊》2017年48期:联大外文系主任叶公超让学生念一句英语就能判断出学生的籍贯
    3星|《终身成长》:成长型思维让人进步,固定型思维让人固步自封。有新意的励志书,但有锤子模式的嫌疑。
    4星|《癌症新知:科学终结恐慌》:非常新鲜的癌症科普
    PL/SQL Developer使用技巧
    Oracle数据导入导出imp/exp sp2-0734:未知的命令开头'imp...解决方法
    oracle数据库导入导出命令!
    如何完全卸载VS2010
    Oracle命令(一):Oracle登录命令
  • 原文地址:https://www.cnblogs.com/sap-jerry/p/12844639.html
Copyright © 2011-2022 走看看