{"id":756,"date":"2024-10-14T14:03:28","date_gmt":"2024-10-14T08:33:28","guid":{"rendered":"https:\/\/codexplained.in\/?p=756"},"modified":"2025-11-24T15:52:14","modified_gmt":"2025-11-24T10:22:14","slug":"find-power-of-a-number-using-recursion","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=756","title":{"rendered":"Find Power 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 power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an elegant solution to problems like exponentiation.<\/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 power of a number using recursion.\n * This program takes a base and an exponent as input and computes\n * the result of raising the base to the power of the exponent\n * using a recursive function.\n *\/\n\n\/\/ Recursive function to calculate power\nint power(int base, int exponent) {\n    \/\/ Base case\n    if (exponent == 0) {\n        return 1; \/\/ Any number to the power of 0 is 1\n    }\n    \/\/ Recursive case\n    return base * power(base, exponent - 1);\n}\n\nint main() {\n    int base, exponent;\n\n    printf(&quot;Enter the base: &quot;);\n    scanf(&quot;%d&quot;, &amp;base); \/\/ Read base input\n\n    printf(&quot;Enter the exponent: &quot;);\n    scanf(&quot;%d&quot;, &amp;exponent); \/\/ Read exponent input\n\n    int result = power(base, exponent);\n    printf(&quot;%d raised to the power of %d is: %d\\n&quot;, base, exponent, result);\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 the base and the exponent.<\/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 the base: 2<br>Enter the exponent: 3<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 result of the base raised to the exponent.<\/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>2 raised to the power of 3 is: 8<br><\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\">Conclusion:<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">The power calculation program effectively demonstrates the use of recursion in C to solve problems involving exponentiation. By breaking down the problem into smaller subproblems, the program provides a clear and concise method for computing powers. This approach not only reinforces the concept of recursion but also illustrates its practical application in mathematical computations. Overall, the program serves as a valuable tool for learning about recursive algorithms and their implementation in C.<\/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 power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an [&hellip;]<\/p>\n","protected":false},"author":37,"featured_media":849,"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-756","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 power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an\" \/>\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=756\" \/>\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 Power of a Number using Recursion - Code Explained\" \/>\n\t\t<meta property=\"og:description\" content=\"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/codexplained.in\/?p=756\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2024-10-14T08:33:28+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2025-11-24T10:22:14+00:00\" \/>\n\t\t<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n\t\t<meta name=\"twitter:title\" content=\"Find Power of a Number using Recursion - Code Explained\" \/>\n\t\t<meta name=\"twitter:description\" content=\"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an\" \/>\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=756#blogposting\",\"name\":\"Find Power of a Number using Recursion - Code Explained\",\"headline\":\"Find Power 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_45fosj45fosj45fo.jpeg\",\"width\":2048,\"height\":2048},\"datePublished\":\"2024-10-14T14:03:28+05:30\",\"dateModified\":\"2025-11-24T15:52:14+05:30\",\"inLanguage\":\"en-US\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#webpage\"},\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#webpage\"},\"articleSection\":\"C\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#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=756#listItem\",\"name\":\"Find Power of a Number using Recursion\"},\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"name\":\"Home\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#listItem\",\"position\":3,\"name\":\"Find Power 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=756#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=756#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=756#webpage\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?p=756\",\"name\":\"Find Power of a Number using Recursion - Code Explained\",\"description\":\"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an\",\"inLanguage\":\"en-US\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#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_45fosj45fosj45fo.jpeg\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756\\\/#mainImage\",\"width\":2048,\"height\":2048},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=756#mainImage\"},\"datePublished\":\"2024-10-14T14:03:28+05:30\",\"dateModified\":\"2025-11-24T15:52:14+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 Power of a Number using Recursion - Code Explained","description":"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an","canonical_url":"https:\/\/codexplained.in\/?p=756","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=756#blogposting","name":"Find Power of a Number using Recursion - Code Explained","headline":"Find Power 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_45fosj45fosj45fo.jpeg","width":2048,"height":2048},"datePublished":"2024-10-14T14:03:28+05:30","dateModified":"2025-11-24T15:52:14+05:30","inLanguage":"en-US","mainEntityOfPage":{"@id":"https:\/\/codexplained.in\/?p=756#webpage"},"isPartOf":{"@id":"https:\/\/codexplained.in\/?p=756#webpage"},"articleSection":"C"},{"@type":"BreadcrumbList","@id":"https:\/\/codexplained.in\/?p=756#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=756#listItem","name":"Find Power of a Number using Recursion"},"previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","name":"Home"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=756#listItem","position":3,"name":"Find Power 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=756#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=756#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=756#webpage","url":"https:\/\/codexplained.in\/?p=756","name":"Find Power of a Number using Recursion - Code Explained","description":"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an","inLanguage":"en-US","isPartOf":{"@id":"https:\/\/codexplained.in\/#website"},"breadcrumb":{"@id":"https:\/\/codexplained.in\/?p=756#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_45fosj45fosj45fo.jpeg","@id":"https:\/\/codexplained.in\/?p=756\/#mainImage","width":2048,"height":2048},"primaryImageOfPage":{"@id":"https:\/\/codexplained.in\/?p=756#mainImage"},"datePublished":"2024-10-14T14:03:28+05:30","dateModified":"2025-11-24T15:52:14+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 Power of a Number using Recursion - Code Explained","og:description":"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an","og:url":"https:\/\/codexplained.in\/?p=756","article:published_time":"2024-10-14T08:33:28+00:00","article:modified_time":"2025-11-24T10:22:14+00:00","twitter:card":"summary_large_image","twitter:title":"Find Power of a Number using Recursion - Code Explained","twitter:description":"Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an"},"aioseo_meta_data":{"post_id":"756","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:42","updated":"2025-11-24 10:35:26","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 Power 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 Power of a Number using Recursion","link":"https:\/\/codexplained.in\/?p=756"}],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756","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=756"}],"version-history":[{"count":4,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756\/revisions"}],"predecessor-version":[{"id":1446,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756\/revisions\/1446"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/849"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=756"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=756"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=756"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}