recursion 遞迴範例 | JavaScript 程式專案

{"id":103635,"student_id":97,"content":"console.log('test222');\n\nfunction factorial(n)\n{\n    if( n \u003c= 1 ){\n        return 1;        \n    }else{\n        return factorial(n-1) * n;\n    }\n}\n\nconsole.log(factorial(1))\nconsole.log(factorial(2))\nconsole.log(factorial(3))\nconsole.log(factorial(4))\nconsole.log(factorial(5))\nconsole.log(factorial(6))\n\n\nfunction fibonacci(n)\n{\n    if(n \u003c= 1){\n        return 1;\n    }\n    return fibonacci(n-1) + fibonacci(n-2);\n}\n\nconsole.log(fibonacci(1))\nconsole.log(fibonacci(2))\nconsole.log(fibonacci(3))\nconsole.log(fibonacci(4))\nconsole.log(fibonacci(5))\nconsole.log(fibonacci(6))\n\n\nfunction hanoi (disc, begin, end, helper) {\n    if (disc \u003e 0) {\n        hanoi(disc - 1, begin, helper, end);\n        console.log('移動圓盤 ' + disc + ' 從 ' + begin + ' 到 ' + helper);\n        hanoi(disc - 1, end, begin, helper);\n    }\n};\nhanoi(3, '柱子一', '柱子二', '柱子三');\n\n","created_at":"2019-11-02T09:01:34.583+08:00","updated_at":"2019-11-02T09:24:02.129+08:00","name":"recursion 遞迴範例","language":"javascript","screenshot":{"url":"https://cdn8.koding.school/uploads/project/screenshot/103635/fd1ac05835b665cf0d7e3c5532c7c2d7.jpg"},"parent_id":2,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":143,"hashid":"zpese8dd","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}