Find HCF (GCD) of two numbers using nested loops (for loop) Dry Run in C

Find HCF (GCD) of two numbers using nested loops (for loop) is an interactive C dry run visualizer from the Nested 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 HCF (GCD) of two numbers using nested loops (for loop) Program Code

#include <stdio.h>
int main() {
    int a, b, gcd = 1, i;
    printf("Enter two numbers: ");
    scanf("%d %d", &a, &b);
    
    int min = (a < b) ? a : b;
    
    for(i = 1; i <= min; i++) {
        if(a % i == 0 && b % i == 0) {
            gcd = i;
        }
    }
    
    printf("GCD of %d and %d = %d\n", a, b, gcd);
    return 0;
}

View the complete Nested programs page.