Find the Greatest Common Divisor (GCD) in C

# Introduction

In this lab, you will learn how to find the Greatest Common Divisor (GCD) of two integers using the Euclidean algorithm in a C program. You will start by reading two integers from user input, then apply the Euclidean algorithm to calculate their GCD, and finally print the result. This lab covers fundamental concepts in number theory and discrete mathematics, providing a practical application of these principles using the C programming language.