{"id":4323,"date":"2021-10-04T23:00:00","date_gmt":"2021-10-04T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=4323"},"modified":"2021-10-04T14:16:48","modified_gmt":"2021-10-04T08:46:48","slug":"c-program-to-find-gcd-of-two-numbers-using-recursion","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/c-program-to-find-gcd-of-two-numbers-using-recursion\/","title":{"rendered":"C Program to Find GCD of Two Numbers Using Recursion"},"content":{"rendered":"\n<p>In this post, we will learn <strong>how to find GCD of two numbers using recursion in C<\/strong> Programming language.<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/10\/c-program-to-find-gcd-of-two-numbers-using-recursion-codingbroz.png\" alt=\"C Program to Find GCD of Two Numbers Using Recursion\" class=\"wp-image-4325\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/10\/c-program-to-find-gcd-of-two-numbers-using-recursion-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/10\/c-program-to-find-gcd-of-two-numbers-using-recursion-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\n\n\n\n<p>The <strong>greatest common divisor (GCD)<\/strong> of two nonzero integers <strong>a<\/strong> and <strong>b<\/strong> is the greatest positive integer <strong>d<\/strong> such that <strong>d<\/strong> is a divisor of both <strong>a<\/strong> and <strong>b<\/strong>.<\/p>\n\n\n\n<p>We will define a custom recursive function which will calculate the GCD of two numbers.<\/p>\n\n\n\n<p>So, without further ado, let\u2019s begin this tutorial.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662f55f186e6e\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662f55f186e6e\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-gcd-of-two-numbers-using-recursion\/#C_Program_to_Find_GCD_of_Two_Numbers_Using_Recursion\" title=\"C Program to Find GCD of Two Numbers Using Recursion\">C Program to Find GCD of Two Numbers Using Recursion<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-gcd-of-two-numbers-using-recursion\/#How_Does_This_Program_Work\" title=\"How Does This Program Work ?\">How Does This Program Work ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-gcd-of-two-numbers-using-recursion\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_GCD_of_Two_Numbers_Using_Recursion\"><\/span><strong>C Program to Find GCD of Two Numbers Using Recursion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C Program To Find GCD of Two Number Using Recursion\n#include &lt;stdio.h>\nint GCD(int x, int y);\nint main(){\n    int a, b;\n    \n    \/\/ Asking for Input\n    printf(\"Enter Two Positive Integers: \\n\");\n    scanf(\"%d\\n %d\", &amp;a, &amp;b);\n    \n    printf(\"GCD of %d and %d is %d.\", a, b, GCD(a, b));\n    return 0;\n}\n\nint GCD(int x, int y){\n    if( y != 0)\n        return GCD(y, x % y);\n    else \n        return x;\n}\n<\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter Two Positive Integers: \r\n40\r\n412\r\nGCD of 40 and 412 is 4.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"How_Does_This_Program_Work\"><\/span><strong>How Does This Program Work ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code><strong>    int a, b;<\/strong>\r<\/code><\/pre>\n\n\n\n<p>In this program, we have declared two int data type variables named as <strong>a<\/strong> and <strong>b<\/strong>.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><strong>    \/\/ Asking for Input\r\n    printf(\"Enter Two Positive Integers: \\n\");\r\n    scanf(\"%d\\n %d\", &amp;a, &amp;b);<\/strong>\r<\/code><\/pre>\n\n\n\n<p>Then, the user is asked to enter the value of two integers. The value of these two integers will get stored in <strong>a<\/strong> and <strong>b<\/strong> respectively.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>    <strong>printf(\"GCD of %d and %d is %d.\", a, b, GCD(a, b));<\/strong>\r<\/code><\/pre>\n\n\n\n<p>We print the <strong>GCD <\/strong>of two numbers using<strong> printf()<\/strong> function. Here, we called our custom function which will calculate the <strong>GCD<\/strong> of two numbers.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><strong>int GCD(int x, int y){\r\n    if( y != 0)\r\n        return GCD(y, x % y);\r\n    else \r\n        return x;\r\n}<\/strong>\r<\/code><\/pre>\n\n\n\n<p>We have declared a recursive function named<strong> GCD<\/strong> which will compute and return the <strong>GCD of two numbers<\/strong>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>I hope after going through this post, you understand h<strong>ow to find gcd of two numbers using recursion in C<\/strong> Programming language.<\/p>\n\n\n\n<p>If you have any doubt regarding the program, feel free to contact us in the comment section. We will be delighted to help you<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><\/p>\n\n\n\n<ul><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-calculate-kinetic-energy\/\">C Program To Calculate Kinetic Energy<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-find-grade-of-a-student\/\">C Program To Find Grade of a Student<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-find-sum-of-even-and-odd-numbers\/\">C Program To Find Sum of Even and Odd Numbers<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-find-factorial-of-a-number-using-recursion\/\">C Program To Find Factorial of a Number Using Recursion<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-find-sum-of-natural-numbers-using-recursion\/\">C Program To Find The Sum of Natural Numbers Using Recursion<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will learn how to find GCD of two numbers using recursion in C Programming language.<\/p>\n","protected":false},"author":2,"featured_media":4325,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[167,294],"tags":[222,343,206],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/10\/c-program-to-find-gcd-of-two-numbers-using-recursion-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4323"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=4323"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4323\/revisions"}],"predecessor-version":[{"id":4326,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/4323\/revisions\/4326"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/4325"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=4323"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=4323"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=4323"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}