Find GCD (HCF) of two numbers Dry Run in PYTHON

Find GCD (HCF) of two numbers is an interactive PYTHON dry run visualizer from the While programs section. Study the source code, then use the execution controls to follow each step, variable update, highlighted line, and console output.

This page provides a browser-based dry run with source-code highlighting, auto-scroll, voice narration controls, and execution output for learning the program step by step.

Find GCD (HCF) of two numbers Program Code

# GCD using Euclidean algorithm
a = int(input("Enter first number: "))
b = int(input("Enter second number: "))
num1, num2 = a, b

while b != 0:
    temp = b
    b = a % b
    a = temp

print(f"GCD of {num1} and {num2} = {a}")

View the complete While programs page.