遞迴 | JavaScript 程式專案

{"id":103920,"student_id":97,"content":"function factorial(n)\n{\n    if(n==1){\n        console.log('乘上1');\n        return 1;\n    }\n    console.log('乘上'+n);\n    return n * factorial(n-1);\n}\n\nfunction fibonacci(n)\n{\n    if( n == 0){\n        return 0; \n    }\n    if( n == 1){\n        return 1; \n    }\n    return fibonacci(n-2) + fibonacci(n-1);\n}\n\n\n\n// var result = factorial(3);\n// console.log(result);\n\n\n// var result = fibonacci(5);\n// console.log(result);\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(10, '柱子一', '柱子二', '柱子三');\n\n","created_at":"2019-11-02T10:14:51.195+08:00","updated_at":"2019-11-02T10:40:25.761+08:00","name":"\b遞迴","language":"javascript","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/103920/fd1ac05835b665cf0d7e3c5532c7c2d7.jpg"},"parent_id":2,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":135,"hashid":"yeys34kn","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}