#include <iostream>
#include <vector>
#include <ctime>
#include <cstdlib>
using namespace std;

bool linearSearch(std::vector<int>&primes, int number, int range) {
    for (int i = 0; i < range; i++) {
        if (primes[i] == number)
            return true;
    }
    return false;
}


void timeLinearSearch(std::vector<int>& primes) {
    clock_t start, stop;
    size_t NRND = 15000;    //  15000 primes per clock

    for (int N = 50000; N <= 100000; N += 50000)    // increase by 50k each iteration
    {
        for (int repeat = 0; repeat < 5; repeat++) {
            start = clock();
            int count = 0;
            for (int j = 0; j < NRND; j++) {
                count += linearSearch(primes, rand(), N);
            }
            stop = clock();
            std::cout << stop - start << ", " << N << " " << count << std::endl;
        }
    }
}

int main() {
	vector<int> v;
	for (int i = 0 ; i != 600000 ; i++) {
		v.push_back(rand());
	}
	timeLinearSearch(v);
	return 0;
}