C PROGRAMMING PROGRAM • LOOPS & NUMBER PROBLEMS

Print Prime Numbers in a Range

Learn how to print prime numbers in a range using a clear C program.

IntermediateNested loopsPrime testRange

PROBLEM UNDERSTANDING

Input and expected output

Sample input
10 30
Sample output
11 13 17 19 23 29

COMPLETE C PROGRAM

Complete C implementation

prime-numbers-in-range.c
Open in compiler
#include <stdio.h>

int main(void)
{
    int start, end;

    printf("Enter start and end: ");
    scanf("%d %d", &start, &end);
    if (start > end) {
        int temporary = start; start = end; end = temporary;
    }
    for (int number = start < 2 ? 2 : start; number <= end; number++) {
        int isPrime = 1;
        for (int divisor = 2; divisor <= number / divisor; divisor++) {
            if (number % divisor == 0) { isPrime = 0; break; }
        }
        if (isPrime) printf("%d ", number);
    }
    printf("\n");
    return 0;
}

GUIDED CODE TOUR • NOT LIVE EXECUTION

Study the program line by line

Use the real compiler button above to run and debug with different inputs.

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

11 13 17 19 23 29
0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

  1. Read the required input values.
  2. Run a square-root prime test for every number inside the inclusive range.
  3. Display the computed result.

Run a square-root prime test for every number inside the inclusive range.

EFFICIENCY

Time and space complexity

Time complexity

O(n√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.