This is a simple C program to calculate the Greatest Common Divisor (GCD) of two numbers using the **Euclidean Algorithm**.
-
Updated
Sep 12, 2024 - C
This is a simple C program to calculate the Greatest Common Divisor (GCD) of two numbers using the **Euclidean Algorithm**.
This repository contains a variety of C programming projects and algorithms implemented during my coursework. These include implementations of data structures like Binary Search Trees, various algorithms such as QuickSort and Euclid's Algorithm, and other utility programs like string manipulation functions and array operations.
Un programme qui calcule le pgcd de deux entier par l'algorithme d'Euclide
Add a description, image, and links to the euclidean-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-algorithm topic, visit your repo's landing page and select "manage topics."