24 bytes

  • HOME
  • Algorithms
    blue
  • Bubble Sort
  • Bucket Sort
  • Insertion Sort
  • Selection Sort
  • Merge Sort
  • Quick Sort
  • Heap Sort
  • Counting Sort
  • Stack
  • Queue
  • Double Linked List
  • Binary Search Tree
  • Towers OF Hanoi

  • Java Programs
    green bullet
  • Download RMI Calculator
  • Download file
  • Clock applet
  • File Upload
  • JDOM Parser
  • Client server
  • Udp Client server
  • Sudoku Solver

  • System Programming
  • Newtwork Sniffer
  • Good Links
    green bullet
  • Free Source Code
  • Top Coder
  • Code Project
  • Learn Today
  • Concept
  • Intresting Programs
    green bullet
  • Prime Number
  • GCD Euclids
  • Permutations


  • Google
     
    Web 24bytes.com

    Check if a number is prime

    #include<iostream.h>
    #include <math.h>
    
    void main()
    {
    	int number;
    	cout<<" ---------------------------------------------"<<endl;
    	cout<<" Enter a number to find if its a prime number "<<endl;
    	cout<<" ---------------------------------------------"<<endl;
    	cin>>number;
    	bool a =true;
    	
    	for(int i=2;i<sqrt(number);i++)        //check untill the square root
    	{
    	
    		if(number%i==0)            // if it is divisible it is non prime 
    		{
    			a=false;
    			break;
    		}
    	}
    	
    	
    	if(a==false)
    	cout<<number<<" is not a prime number"<<endl;
    	else
    	cout<<number<<" is  a prime number"<<endl;
    
    }
    
    
    request a code or suggestion


    Email:
    Category


    Google
     
    Web 24bytes.com
    . original template by Aran Down.