輾轉相除法（預設版）副本 | JavaScript 程式專案

{"id":313580,"student_id":6762,"content":"// 最大公因數(gcd)迴圈\n// function gcd (a, b) {\n//     while (a != b) {\n//         if (a \u003e b) {\n//             a = a - b;\n//         } else {\n//             b = b - a;\n//         }\n//     }\n//     return a;\n// }\n// 最大公因數(gcd)遞迴\nfunction gcd (a, b) {\n    if (a == b) {\n        return a;\n    }\n    if(a \u003e b) {\n        return gcd(a - b, b);\n    }else{\n        return gcd(a, b - a);\n    }\n    return a;\n}\n//測試\nfunction test (a, b, answer) {\n    var result = gcd(a, b);\n    console.log(`\n        程式算出 ${a} 和 ${b} 的最大公因數是 ${result}`);\n}\ntest(51, 85, 17);\ntest(60, 50, 10);\ntest(64, 48, 16);\ntest(99, 77, 11);\ntest(97, 17, 1);","created_at":"2021-11-13T10:13:16.208+08:00","updated_at":"2021-11-13T11:10:01.041+08:00","name":"輾轉相除法（預設版） 副本","language":"javascript","screenshot":{"url":"https://cdn4.koding.school/uploads/project/screenshot/313580/5cef79b2ec0469b708d321e72d20aec4.jpg"},"parent_id":163010,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":27,"hashid":"npms36p3k","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}