luisfmelo
2/20/2017 - 9:20 AM

C++ experiments @ FEUP

Calculate Execution Time - C++ Is prime number optimized - C++

#include <iostream>
#include <chrono>

using namespace std;
using namespace std::chrono;

void function()
{
	long long number = 0;

	for( long long i = 0; i != 2000000; ++i ){
		number += 5;
	}
}

int main()
{
	high_resolution_clock::time_point t1 = high_resolution_clock::now();
	function();
	high_resolution_clock::time_point t2 = high_resolution_clock::now();

	auto duration = duration_cast<microseconds>( t2 - t1 ).count();

	cout << duration;
	return 0;
}
int is_prime(long int num){
    if ( num == 1 )
        return false;
    else if ( num < 4 )
        return true;
    else if ( num % 2 == 0)
        return false;
    else if ( num < 9 )
        return true;
    else if ( num % 3 == 0)
        return false;
 
 
    for(long int f = 5; f <= floor(sqrt(num)) ; f+=6){
        if ( num % f == 0 )
            return false;
        if ( num % (f + 2) == 0 )
            return false;
    }
    return true;
}