Hi, I need to write an algorithm that checks if a given number is a prime number or not in c++. It should be written in a function and if its a prime number it should return true. Otherwise the function should return false..

Thanks.

what are the bounds for the assignment? are you expected to take in numbers up to a certain digit count?

the most dumb way is to check for divisors starting from the input/2, then looping down to 2. there are other, better heuristics you can employ to shorten the computation, but there is no catchall function for testing primeness of any arbitrary number.

http://en.wikipedia.org/wiki/Primality_test

This post was edited by irimi on Oct 2 2013 03:03pm

pussy