C PROGRAMMING PROGRAM • CONTROL FLOW & LOOP FORMS

Find the First Divisor Using break

Learn how to find the first divisor using break using a clear C program.

BeginnerbreakLoop terminationDivisibility

PROBLEM UNDERSTANDING

Input and expected output

Sample input

Sample output

First divisor = 7

COMPLETE C PROGRAM

Complete C implementation

#include <stdio.h>

int main(void)
{
    int number, divisor = 0;
    printf("Enter an integer greater than 1: ");
    scanf("%d", &number);
    for (int candidate = 2; candidate < number; candidate++) {
        if (number % candidate == 0) {
            divisor = candidate;
            break;
        }
    }
    if (divisor) printf("First divisor = %d\n", divisor);
    else puts("The number is prime.");
    return 0;
}

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

First divisor = 7

0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

Read the required input values.
Stop the search immediately after the first proper divisor is found.
Display the computed result.

Stop the search immediately after the first proper divisor is found.

EFFICIENCY

Time and space complexity

Time complexity

O(n)

Auxiliary space

O(1)

DEBUGGING CHECKLIST

Common mistakes

Check this

Use the correct format specifier for every variable.

Check this

Initialize variables before using their values.

Check this

Check braces, semicolons and input order carefully.

Try it yourself

Practice: Run the program with the sample input, predict its output, and then test one boundary case of your own.