# C Program to Find GCD of two Numbers1 min read

This tutorial will teach you how to find the GCD (Greatest Common Divisor) or HCF of two numbers in C. To understand this example, you should have knowledge of the following C programming topics.

The GCD(Greatest Common Divisor) of two integers is the largest integer that can exactly divide both numbers (without a remainder). Example: HCF of 12 and 18 is 6.

## 1. C Program to Find GCD of two Numbers using while loop and if..else Statement

Output:

`Enter 2 positive integers: 12 18 GCD (Greatest Common Divisor): 6`

## 2. C Program to Find GCD of two Numbers using for loop and if Statement

Output:

`Enter 2 positive integers: `
`12 `
`18 `
`GCD of 12 and 18: 6`

### Java Program to find the sum of the Largest Forward Diagonal

in this tutorial, we will write a java program to find the sum of the Largest Forward Diagonal in an Arraylist (matrix). Java Program to …

### C Program to search an element in an array using Pointers

A separate function( search_function()) will be created where the array pointer will be declared and the searched element along with the size of an array …

### C Program to find the sum of the digits of a number using recursion function

This C program calculates the sum of digits of a given number using recursion. Here’s a concise explanation: Function Definition: sumDigits(int n) This function calculates …

### C program to find factorial of a numberĀ using Ternary operator with Recursion

Recursion refers to the function calling itself directly or in a cycle. Before we begin, you should have the knowledge of following in C Programming: …

### C Program to Add Two Numbers Using Call by Reference

The program takes the two numbers from the user and passes the reference to the function where the sum is calculated. You may go through …

### Find the output ab, cd, ef, g for the input a,b,c,d,e,f,g in Javascript and Python

In this tutorial, we will write a program to find a pairs of elements from an array such that for the input [a,b,c,d,e,f,g] we will …