Skip to main content

Generate series of prime numbers using java


import java.io.*;
class prime_series
{
   public static void main(String args[])
  { int st,end;
    int flag=0;
    DataInputStream in=new DataInputStream(System.in);
    System.out.print("Enter starting range: ");
    st=Integer.parseInt(in.readLine());
    System.out.print("\nEnter ending range: ");
    end=Integer.parseInt(in.readLine());
    for(int i=st;i<=end;i++)
    {
     for(int j=2;j<=i/2;j++)
     { if(i%j==0)
        { flag=1;
           break;
         }
       else
        flag=0;
     }
     if(flag==0)
      System.out.print(i + " ");
    }
  }
}
   

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};