lab6.tar

primes.cpp0000600006513700162730000000217214323704552012635 0ustar  lsmit248lsmit248// Lab 6: Is it prime?
/* Laura Smith 10/18/22 9:30 pm Primes Lab part 1
This part of the lab lists out primes in lines of 20 up to the inputed
max value. I used booleans and loops to do this and learned more about
both. This was the beginning of the lab and was the first step to later
solving other parts. 
*/

#include <iostream>

using namespace std;

int main() {

  int max;              //max
  bool is_prime = true; //bool for prime/notprime
  cin >> max;           //only takes in one max
  int num = 2;
  int count = 0;        //to count how many are printed per line

  while (num <= max){
    if (num != 0 && num != 1){
        for (int i = 2; i <= num/2; i++){ //goes through num/2 to test if it's prime or not
            if (num % i == 0){
                is_prime = false;
                break;
            }
            is_prime = true;
        }
    }

        if (is_prime){ //only prints out the primes
        cout << num << ", ";
        count ++;
            if (count % 20 == 0){ // to keep it at 20 per line
                cout << endl;
            }
        }

            
    num++; //iteration
  }
  
  return 0;

}primes2.cpp0000600006513700162730000000345214323704556012725 0ustar  lsmit248lsmit248// Lab 6: Is it prime?
/* Laura Smith 10/18/22 9:30 pm Primes Lab part 2
This part of the lab stores the primes in a vector and then uses find to
determine if the number is prime based on if it was added to the vector or not.
This part of the lab taught me to use vector iterators and the stl function
find as well as improving my vector abilities. 
*/

#include <iostream>
#include <vector>         //vectors duh
#include <bits/stdc++.h>  //for the iteration and find
#include <cmath>          //used sqrt

using namespace std;

int main(int argc, char *argv[]) {

  int max = 0;                //user's inputted max
  bool is_prime = true;       //bool of is or isn't prime
  vector <int> primes;      
  vector <int>::iterator it;  //vector and iterator for primes
  int num = 2;

  int oldMax = max;           //initializing max and old max to 0

  while (cin >> max){
  
    if (oldMax < max){ //only runs if there's more to add
    
      while (num <= max){
        if (num != 0 && num != 1){// to start at 2 to save time
            for (int i = 2; i <= sqrt(num); i++){//goes through sqrt num to check if it's prime
                if (num % i == 0){
                    is_prime = false;
                    break;
                }
                is_prime = true;
            }
        }

            if (is_prime){//when it's prime it's added to the vector with pushback
            // add to vector 
              primes.push_back(num);
            }

                
        num++; //iterate the number
      }
    }
    oldMax = max; //to keep track of what the old max is


    //find function which uses and iterator to look for the max
    it = find (primes.begin(), primes.end(), max);
    if (it != primes.end())
      cout << "prime" << endl;
    else
      cout << "not prime" << endl;
  }
  

  return 0;

}

report.txt0000600006513700162730000000145414323702513012703 0ustar  lsmit248lsmit248Laura Smith 10/18/22 9:25 pm Primes Lab part 3
This part of the lab was to find the time it takes 
to do different methods of solving primes. We used 
the stl function find, bit maps, found the load factor, 
used the stl function binary search and the stl function
map. Each took different amounts of time.

1. using find
	- 1.33 s
	- 1.32 s
	- 1.32 s

2. Bitmap
	- 1.36 s
	- 1.43 s
	- 1.43 s

3. Load Factor
	- 148933

4. Binary_search
	- 1.33 s
	- 1.34 s
	- 1.33 s

5. Map
	- 2.87 s
	- 2.88 s
	- 2.91 s

Surprisingly my map function took the longest, which 
I didn't expect. I also didn't expect find, binary 
search, and the bitmap to be so similar in times. 
Through my methods most of them are very similar and
none of the methods were apparently better than the 
others.