# Introduction In C programming, GCD (Greatest Common Divisor) is calculated often. Two different ways are commonly used to find GCD. We can use the Euclidean algorithm and calculate GCD by repeated subtraction. In this step-by-step lab, we will demonstrate both methods.
Click the virtual machine below to start practicing