Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Name: Ryan Lazzari
- * Class: Programming I
- * Section Number: ***********
- * Project Number: 9
- * The purpose of this program is to
- * return all prime numbers between
- * 0 and a number specified by
- * the user.
- */
- #include <iostream>
- #include <iomanip>
- using namespace std;
- // prototypes
- bool IsPrime(int);
- int main()
- {
- // Declare variables
- int userNumber;
- bool primeNumber;
- // Prompt user for input
- cout << "Please input a positive number: ";
- cin >> userNumber;
- while (userNumber <= 1)
- {
- cout << "Invalid entry. Please enter an integer greater than 1.";
- }
- cout << '\n' << "The prime numbers less than or equal to " << userNumber << " are:" << '\n';
- // Display results
- primeNumber = IsPrime(userNumber);
- }
- bool IsPrime(int userNumber)
- {
- // Declare variables
- bool primeNumber = false;
- int i = 2;
- int lineCounter = 0;
- int currentNumber=2;
- for (currentNumber = 2; currentNumber < userNumber; currentNumber++)
- {
- for (i = 2; i < currentNumber; i++)
- {
- if (currentNumber % i == 0)
- {
- primeNumber = true;
- break;
- }
- }
- if (primeNumber = false)
- {
- cout << currentNumber << '\t';
- return currentNumber;
- currentNumber++;
- lineCounter++;
- if (lineCounter == 8)
- lineCounter = 0;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement