{"id":6341,"date":"2025-06-02T17:34:03","date_gmt":"2025-06-02T12:04:03","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=6341"},"modified":"2025-06-02T17:34:03","modified_gmt":"2025-06-02T12:04:03","slug":"function-to-calculate-factorial-of-a-number-using-recursion","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/function-to-calculate-factorial-of-a-number-using-recursion\/","title":{"rendered":"Function to calculate factorial of a number using Recursion"},"content":{"rendered":"\n<!-- Prism.js CSS and JS -->\n<link href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.css\" rel=\"stylesheet\" \/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n  .wp_blog_code-tabs-container {\n    font-family: \"Segoe UI\", sans-serif !important;\n    max-width: 900px !important;\n    margin: 2rem auto !important;\n    border: 1px solid #ddd !important;\n    border-radius: 8px !important;\n    overflow: hidden !important;\n    background-color: white !important;\n  }\n\n  .wp_blog_code-tabs-header {\n    background: #f7f7f7 !important;\n    display: flex !important;\n    border-bottom: 1px solid #ddd !important;\n  }\n\n  .wp_blog_code-tab-button {\n    flex: 1 !important;\n    padding: 10px 15px !important;\n    border: none !important;\n    background: transparent !important;\n    cursor: pointer !important;\n    font-weight: bold !important;\n    transition: background 0.2s !important;\n    color: #242B33 !important;\n  }\n\n  .wp_blog_code-tab-button.active {\n    background: white !important;\n    border-bottom: 3px solid #0073aa !important;\n  }\n\n  .wp_blog_code-tab-content {\n    display: none !important;\n    padding: 20px !important;\n    background: #242B33 !important;\n  }\n\n  .wp_blog_code-tab-content > pre {\n    background: #242B33 !important;\n  }\n\n  .wp_blog_code-tab-content.active {\n    display: block !important;\n  }\n\n  .wp_blog_code-tab-content pre {\n    margin: 0 !important;\n    overflow-x: auto !important;\n  }\n\n  .wp_blog_explanation {\n    max-width: 900px !important;\n    margin: 2rem auto !important;\n    font-family: \"Segoe UI\", sans-serif !important;\n    line-height: 1.6 !important;\n    background: white !important;\n    color: black !important;\n    padding: 1rem !important;\n    border-radius: 8px !important;\n  }\n\n  .wp_blog_explanation h2 {\n    color: #0073aa !important;\n    font-size: 1.5rem !important;\n    margin-bottom: 0.5rem !important;\n  }\n\n  .wp_blog_explanation code {\n    background: #f1f1f1 !important;\n    padding: 2px 6px !important;\n    border-radius: 4px !important;\n    font-family: monospace !important;\n  }\n<\/style>\n\n<!-- Explanation Block -->\n<div class=\"wp_blog_explanation\">\n  <p>Write a recursive function <code>fact(n)<\/code> that returns the factorial of a number <code>n<\/code>.<\/p>\n\n  <h2>Concepts<\/h2>\n  <ul>\n    <li><strong>Recursion:<\/strong> Repeatedly multiply <code>n<\/code> with <code>fact(n - 1)<\/code>.<\/li>\n    <li><strong>Base Case:<\/strong> <code>fact(1) = 1<\/code><\/li>\n    <li><strong>Recursive Case:<\/strong> <code>n * fact(n - 1)<\/code><\/li>\n  <\/ul>\n\n  <h2>Time &#038; Space Complexity<\/h2>\n  <ul>\n    <li><strong>Time Complexity:<\/strong> <code>O(n)<\/code><\/li>\n    <li><strong>Space Complexity:<\/strong> <code>O(n)<\/code> (recursive stack)<\/li>\n  <\/ul>\n\n  <h2>Examples<\/h2>\n  <pre><code>Input: 5\nOutput: 120 (5 * 4 * 3 * 2 * 1)<\/code><\/pre>\n\n  <h2>Approach<\/h2>\n  <ul>\n    <li>If <code>n == 1<\/code>, return 1 (base case).<\/li>\n    <li>Else, return <code>n * fact(n - 1)<\/code>.<\/li>\n  <\/ul>\n<\/div>\n\n<!-- Code Tabs -->\n<div class=\"wp_blog_code-tabs-container\">\n  <div class=\"wp_blog_code-tabs-header\">\n    <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n    <pre><code class=\"language-javascript\">\nfunction fact(n) {\n  if (n === 1) return 1;\n  return n * fact(n - 1);\n}\n\nconsole.log(fact(5)); \/\/ Output: 120\n    <\/code><\/pre>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n    <pre><code class=\"language-c\">\n#include &lt;stdio.h&gt;\n\nint fact(int n) {\n  if (n == 1) return 1;\n  return n * fact(n - 1);\n}\n\nint main() {\n  printf(\"%d\\n\", fact(5)); \/\/ Output: 120\n  return 0;\n}\n    <\/code><\/pre>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n    <pre><code class=\"language-cpp\">\n#include &lt;iostream&gt;\nusing namespace std;\n\nint fact(int n) {\n  if (n == 1) return 1;\n  return n * fact(n - 1);\n}\n\nint main() {\n  cout << fact(5) << endl; \/\/ Output: 120\n  return 0;\n}\n    <\/code><\/pre>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n    <pre><code class=\"language-java\">\npublic class Main {\n  public static int fact(int n) {\n    if (n == 1) return 1;\n    return n * fact(n - 1);\n  }\n\n  public static void main(String[] args) {\n    System.out.println(fact(5)); \/\/ Output: 120\n  }\n}\n    <\/code><\/pre>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n    <pre><code class=\"language-python\">\ndef fact(n):\n    if n == 1:\n        return 1\n    return n * fact(n - 1)\n\nprint(fact(5))  # Output: 120\n    <\/code><\/pre>\n  <\/div>\n\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n    <pre><code class=\"language-csharp\">\nusing System;\n\nclass Program {\n    static int Fact(int n) {\n        if (n == 1) return 1;\n        return n * Fact(n - 1);\n    }\n\n    static void Main() {\n        Console.WriteLine(Fact(5)); \/\/ Output: 120\n    }\n}\n    <\/code><\/pre>\n  <\/div>\n<\/div>\n\n<!-- Tab Switch Script -->\n<script>\n  document.addEventListener('DOMContentLoaded', function () {\n    const buttons = document.querySelectorAll('.wp_blog_code-tab-button');\n    const contents = document.querySelectorAll('.wp_blog_code-tab-content');\n\n    buttons.forEach(button => {\n      button.addEventListener('click', () => {\n        const lang = button.getAttribute('data-lang');\n\n        buttons.forEach(btn => btn.classList.remove('active'));\n        button.classList.add('active');\n\n        contents.forEach(content => {\n          content.classList.toggle('active', content.getAttribute('data-lang') === lang);\n        });\n      });\n    });\n  });\n<\/script>\n\n\n\n","protected":false},"excerpt":{"rendered":"<p>Write a recursive function fact(n) that returns the factorial of a number n. Concepts Recursion: Repeatedly multiply n with fact(n &#8211; 1). Base Case: fact(1) = 1 Recursive Case: n * fact(n &#8211; 1) Time &#038; Space Complexity Time Complexity: O(n) Space Complexity: O(n) (recursive stack) Examples Input: 5 Output: 120 (5 * 4 *<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[260,175,811,810,174,172],"tags":[],"class_list":{"0":"post-6341","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-c-c-plus-plus","7":"category-cplusplus","8":"category-data-structures-and-algorithms","9":"category-dsa","10":"category-java","11":"category-javascript"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6341","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=6341"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6341\/revisions"}],"predecessor-version":[{"id":6342,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6341\/revisions\/6342"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=6341"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=6341"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=6341"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}