Description

To find all prime numbers in a given range, take a loop and check if number
is prime or not. If it is prime print it else skip it.

C/C++

/* C Program to find all prime numbers in given range */
//Save it as PrimeNumbersInGivenRange.c

#include<stdio.h>
#include<stdbool.h>
bool checkPrime(int);

int main(){

    int i, range;

    printf("Enter a range : ");
    scanf("%d",&range);

    printf("The all prime numbers are : ");
    for(i=2;i<=range;i++) {
        if(checkPrime(i)) {
            printf("\n%d",i);
        }
    }
}

//Function to check prime number
bool checkPrime(int num) {

    int k, flag = 0;
    for(k=2;k<=num/2;k++) {
        if(num%k == 0 ) {
            flag = 1;
            break;
        }
    }

    if(flag == 1)
        return false;
    else
        return true;
}

Input:
Enter a range : 10

Output:
The all prime numbers are : 
2
3
5
7

Java

/* Java Program to find all prime numbers in given range */
//Save it as PrimeNumbersInGivenRange.java

import java.io.*;
import java.util.Scanner;

public class PrimeNumbersInGivenRange {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        
        System.out.println("Enter a range : ");
        int range = scanner.nextInt();
        
        System.out.println("The all prime numbers are : ");
        for(int i=2;i<=range;i++) {
            if(checkPrime(i)) {
                System.out.println(i);
            }
        }
    }
    
    //Function to check prime number
    private static boolean checkPrime(int num) {

        int flag = 0;
        for(int k=2;k<=num/2;k++) {
            if(num%k == 0 ) {
                flag = 1;
                break;
            }
        }
        
        if(flag == 1)
            return false;
        else
            return true;
    }
}

Input:
Enter a range : 
10

Output:
The all prime numbers are : 
2
3
5
7

Related programs