{"id":767,"date":"2024-10-14T14:03:15","date_gmt":"2024-10-14T08:33:15","guid":{"rendered":"https:\/\/codexplained.in\/?p=767"},"modified":"2025-11-24T15:52:36","modified_gmt":"2025-11-24T10:22:36","slug":"find-factorial-of-a-number-using-recursion","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=767","title":{"rendered":"Find Factorial of a Number using Recursion"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\">Introduction:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that simplifies complex problems by breaking them down into smaller, more manageable parts.<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\n#include &lt;stdio.h&gt;\n\n\/*\n * Program to calculate the factorial of a number using recursion.\n * This program takes a non-negative integer as input and computes\n * its factorial through a recursive function.\n *\/\n\n\/\/ Recursive function to calculate factorial\nlong long factorial(int n) {\n    \/\/ Base case\n    if (n == 0 || n == 1) {\n        return 1; \/\/ 0! and 1! both equal 1\n    }\n    \/\/ Recursive case\n    return n * factorial(n - 1);\n}\n\nint main() {\n    int number;\n\n    printf(&quot;Enter a non-negative integer: &quot;);\n    scanf(&quot;%d&quot;, &amp;number); \/\/ Read integer input\n\n    if (number &lt; 0) {\n        printf(&quot;Factorial is not defined for negative numbers.\\n&quot;);\n    } else {\n        long long result = factorial(number);\n        printf(&quot;Factorial of %d is: %lld\\n&quot;, number, result);\n    }\n\n    return 0;\n}\n\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Input\/Output Block:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Input:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The user is prompted to enter a non-negative integer.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Example Input:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>Enter a non-negative integer: 5<br><\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Output:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The program outputs the factorial of the given integer.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Example Output:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>Factorial of 5 is: 120<br><\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\">Conclusion:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">The factorial calculation program effectively demonstrates the use of recursion in C to solve problems involving mathematical computations. By implementing a recursive approach, the program showcases how complex problems can be solved through simpler, smaller instances. This not only reinforces the concept of recursion but also highlights its practical application in calculating factorials. Overall, the program serves as an educational tool for understanding recursive algorithms and their implementation in C, emphasizing the importance of careful handling of base cases and input validation.<\/p>\n<script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script><script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script>","protected":false},"excerpt":{"rendered":"<p>Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that [&hellip;]<\/p>\n","protected":false},"author":37,"featured_media":862,"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,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[75],"tags":[],"class_list":["post-767","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 4.9.8 - aioseo.com -->\n\t<meta name=\"description\" content=\"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Khushi Bhayani\"\/>\n\t<meta name=\"google-site-verification\" content=\"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg\" \/>\n\t<link rel=\"canonical\" href=\"https:\/\/codexplained.in\/?p=767\" \/>\n\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 4.9.8\" \/>\n\t\t<meta property=\"og:locale\" content=\"en_US\" \/>\n\t\t<meta property=\"og:site_name\" content=\"Code Explained -\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"Find Factorial of a Number using Recursion - Code Explained\" \/>\n\t\t<meta property=\"og:description\" content=\"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/codexplained.in\/?p=767\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2024-10-14T08:33:15+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2025-11-24T10:22:36+00:00\" \/>\n\t\t<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n\t\t<meta name=\"twitter:title\" content=\"Find Factorial of a Number using Recursion - Code Explained\" \/>\n\t\t<meta name=\"twitter:description\" content=\"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that\" \/>\n\t\t<script type=\"application\/ld+json\" class=\"aioseo-schema\">\n\t\t\t{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"BlogPosting\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#blogposting\",\"name\":\"Find Factorial of a Number using Recursion - Code Explained\",\"headline\":\"Find Factorial of a Number using Recursion\",\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=37#author\"},\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/Gemini_Generated_Image_ky2rcxky2rcxky2r.jpeg\",\"width\":2048,\"height\":2048},\"datePublished\":\"2024-10-14T14:03:15+05:30\",\"dateModified\":\"2025-11-24T15:52:36+05:30\",\"inLanguage\":\"en-US\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#webpage\"},\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#webpage\"},\"articleSection\":\"C\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#breadcrumblist\",\"itemListElement\":[{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/codexplained.in\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"position\":2,\"name\":\"C\",\"item\":\"https:\\\/\\\/codexplained.in\\\/?cat=75\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#listItem\",\"name\":\"Find Factorial of a Number using Recursion\"},\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"name\":\"Home\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#listItem\",\"position\":3,\"name\":\"Find Factorial of a Number using Recursion\",\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}}]},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\",\"name\":\"Bhagchandani Niraj\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#personImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"Bhagchandani Niraj\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=37#author\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?author=37\",\"name\":\"Khushi Bhayani\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#authorImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/076afe79bb3aee985f2cf9c95a706c913bca92070fc7926481caafc37274e2f6?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"Khushi Bhayani\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#webpage\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?p=767\",\"name\":\"Find Factorial of a Number using Recursion - Code Explained\",\"description\":\"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that\",\"inLanguage\":\"en-US\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#breadcrumblist\"},\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=37#author\"},\"creator\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=37#author\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/Gemini_Generated_Image_ky2rcxky2rcxky2r.jpeg\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767\\\/#mainImage\",\"width\":2048,\"height\":2048},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=767#mainImage\"},\"datePublished\":\"2024-10-14T14:03:15+05:30\",\"dateModified\":\"2025-11-24T15:52:36+05:30\"},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\",\"url\":\"https:\\\/\\\/codexplained.in\\\/\",\"name\":\"Code Explained\",\"inLanguage\":\"en-US\",\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"}}]}\n\t\t<\/script>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"Find Factorial of a Number using Recursion - Code Explained","description":"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that","canonical_url":"https:\/\/codexplained.in\/?p=767","robots":"max-image-preview:large","keywords":"","webmasterTools":{"google-site-verification":"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg","miscellaneous":""},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"BlogPosting","@id":"https:\/\/codexplained.in\/?p=767#blogposting","name":"Find Factorial of a Number using Recursion - Code Explained","headline":"Find Factorial of a Number using Recursion","author":{"@id":"https:\/\/codexplained.in\/?author=37#author"},"publisher":{"@id":"https:\/\/codexplained.in\/#person"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/Gemini_Generated_Image_ky2rcxky2rcxky2r.jpeg","width":2048,"height":2048},"datePublished":"2024-10-14T14:03:15+05:30","dateModified":"2025-11-24T15:52:36+05:30","inLanguage":"en-US","mainEntityOfPage":{"@id":"https:\/\/codexplained.in\/?p=767#webpage"},"isPartOf":{"@id":"https:\/\/codexplained.in\/?p=767#webpage"},"articleSection":"C"},{"@type":"BreadcrumbList","@id":"https:\/\/codexplained.in\/?p=767#breadcrumblist","itemListElement":[{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","position":1,"name":"Home","item":"https:\/\/codexplained.in","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","position":2,"name":"C","item":"https:\/\/codexplained.in\/?cat=75","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=767#listItem","name":"Find Factorial of a Number using Recursion"},"previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","name":"Home"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=767#listItem","position":3,"name":"Find Factorial of a Number using Recursion","previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}}]},{"@type":"Person","@id":"https:\/\/codexplained.in\/#person","name":"Bhagchandani Niraj","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=767#personImage","url":"https:\/\/secure.gravatar.com\/avatar\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g","width":96,"height":96,"caption":"Bhagchandani Niraj"}},{"@type":"Person","@id":"https:\/\/codexplained.in\/?author=37#author","url":"https:\/\/codexplained.in\/?author=37","name":"Khushi Bhayani","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=767#authorImage","url":"https:\/\/secure.gravatar.com\/avatar\/076afe79bb3aee985f2cf9c95a706c913bca92070fc7926481caafc37274e2f6?s=96&d=mm&r=g","width":96,"height":96,"caption":"Khushi Bhayani"}},{"@type":"WebPage","@id":"https:\/\/codexplained.in\/?p=767#webpage","url":"https:\/\/codexplained.in\/?p=767","name":"Find Factorial of a Number using Recursion - Code Explained","description":"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that","inLanguage":"en-US","isPartOf":{"@id":"https:\/\/codexplained.in\/#website"},"breadcrumb":{"@id":"https:\/\/codexplained.in\/?p=767#breadcrumblist"},"author":{"@id":"https:\/\/codexplained.in\/?author=37#author"},"creator":{"@id":"https:\/\/codexplained.in\/?author=37#author"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/Gemini_Generated_Image_ky2rcxky2rcxky2r.jpeg","@id":"https:\/\/codexplained.in\/?p=767\/#mainImage","width":2048,"height":2048},"primaryImageOfPage":{"@id":"https:\/\/codexplained.in\/?p=767#mainImage"},"datePublished":"2024-10-14T14:03:15+05:30","dateModified":"2025-11-24T15:52:36+05:30"},{"@type":"WebSite","@id":"https:\/\/codexplained.in\/#website","url":"https:\/\/codexplained.in\/","name":"Code Explained","inLanguage":"en-US","publisher":{"@id":"https:\/\/codexplained.in\/#person"}}]},"og:locale":"en_US","og:site_name":"Code Explained -","og:type":"article","og:title":"Find Factorial of a Number using Recursion - Code Explained","og:description":"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that","og:url":"https:\/\/codexplained.in\/?p=767","article:published_time":"2024-10-14T08:33:15+00:00","article:modified_time":"2025-11-24T10:22:36+00:00","twitter:card":"summary_large_image","twitter:title":"Find Factorial of a Number using Recursion - Code Explained","twitter:description":"Introduction: This C program calculates the factorial of a non-negative integer using a recursive function. Factorial, denoted as n!n!n!, is the product of all positive integers up to nnn. This program prompts the user to input a non-negative integer and computes its factorial through repeated recursive calls. Recursion is a powerful technique in programming that"},"aioseo_meta_data":{"post_id":"767","title":null,"description":null,"keywords":null,"keyphrases":{"focus":{"keyphrase":"","score":0,"analysis":{"keyphraseInTitle":{"score":0,"maxScore":9,"error":1}}},"additional":[]},"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":"","og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"BlogPosting","isEnabled":true},"graphs":[]},"schema_type":"default","schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":"-1","robots_max_videopreview":"-1","robots_max_imagepreview":"large","priority":null,"frequency":"default","local_seo":null,"breadcrumb_settings":null,"limit_modified_date":false,"ai":null,"created":"2024-10-11 09:06:17","updated":"2025-11-24 10:34:29","seo_analyzer_scan_date":null},"aioseo_breadcrumb":"<div class=\"aioseo-breadcrumbs\"><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\" title=\"Home\">Home<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\/?cat=75\" title=\"C\">C<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\tFind Factorial of a Number using Recursion\n\t\t<\/span><\/div>","aioseo_breadcrumb_json":[{"label":"Home","link":"https:\/\/codexplained.in"},{"label":"C","link":"https:\/\/codexplained.in\/?cat=75"},{"label":"Find Factorial of a Number using Recursion","link":"https:\/\/codexplained.in\/?p=767"}],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/767","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/37"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=767"}],"version-history":[{"count":5,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/767\/revisions"}],"predecessor-version":[{"id":1447,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/767\/revisions\/1447"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/862"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=767"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=767"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=767"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}