A while back I created a program to check if a number was prime. Basically it checked to see if a number was divisible by any number between 2 and it's square root, if it returned true, the number wasn't prime, if it returned false, it would print it out to a file with a comma and a space ', '
I don't mind redoing it in C (the original was done in C++) but I haven't made a .h file and I figured it would be a learning experience.
I also heard about limits.h and I'd like to change the limit--temporarily--to one centillion (a number with 100 '0s' after it) to see how high I can compute prime numbers. As I think I'd need to do this to calculate any prime number above 2,147,483,647 (or below -2,147,483,647 for that matter).
The algorithm I don't really need help with, mostly just the .h files and any info on creating a function and modifying 'limits.h' to suit my purposes.