Determining if a number is prime

by 
bool isPrime(int number){

    if(number < 2) return false;
    if(number == 2) return true;
    if(number % 2 == 0) return false;
    for(int i=3; (i*i)<=number; i+=2){
        if(number % i == 0 ) return false;
    }
    return true;

}

More Related Contents:

  1. Which is the fastest algorithm to find prime numbers?
  2. Printing prime numbers from 1 through 100
  3. Fastest algorithm for primality test [closed]
  4. Mixing two arrays by alternating elements two by two
  5. banker’s algorithm in c++
  6. What is the difference between palindrome permutation and permutation? [closed]
  7. How to replace all occurrences of a character in string?
  8. Rotating a point about another point (2D)
  9. Sorting zipped (locked) containers in C++ using boost or the STL
  10. std::transform() and toupper(), no matching function
  11. C++ string::find complexity
  12. what is the difference between set and unordered_set in C++?
  13. C++ Efficiently Calculating a Running Median [duplicate]
  14. Most efficient/elegant way to clip a number?
  15. The intersection of two sorted arrays
  16. Finding nearest point in an efficient way
  17. sine wave that slowly ramps up frequency from f1 to f2 for a given time
  18. Fast n choose k mod p for large n?
  19. Inverting a 4×4 matrix
  20. Print 2-D Array in clockwise expanding spiral from center
  21. Why would anyone use set instead of unordered_set?
  22. std::back_inserter for a std::set?
  23. How to rotate a N x N matrix by 90 degrees? [closed]
  24. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  25. Why there is no std::copy_if algorithm?
  26. LRU implementation in production code
  27. priority queue with limited space: looking for a good algorithm
  28. C#: How to make Sieve of Atkin incremental
  29. How can I test whether a number is a power of 2?
  30. Checking if all elements of a vector are equal in C++

Leave a Comment