Well gprof is saying the factorial is quite fast, execution time is 0, so, I'll roll out my own time keeper,
Now, the main function is modified as,
int main(void)
{
int number,result;
time_t startTime,endTime;
printf("\nEnter number: ");
scanf("%d",&number);
time(&startTime);
result = factorial(number);
time(&endTime);
printf("\nStart Time: %d\nEnd Time: %d\n%d! = %d",startTime,endTime,number,result);
printf("\nTime for calculation: %d",difftime(endTime,startTime));
return 0;
}
Executing I get,
Enter number: 19
Start Time: 1320051528
End Time: 1320051528
12! = 479001600
Time for calculation: 0
Bad, bad factorial is too simple... A better challenge is needed....
Now, the main function is modified as,
int main(void)
{
int number,result;
time_t startTime,endTime;
printf("\nEnter number: ");
scanf("%d",&number);
time(&startTime);
result = factorial(number);
time(&endTime);
printf("\nStart Time: %d\nEnd Time: %d\n%d! = %d",startTime,endTime,number,result);
printf("\nTime for calculation: %d",difftime(endTime,startTime));
return 0;
}
Executing I get,
Enter number: 19
Start Time: 1320051528
End Time: 1320051528
12! = 479001600
Time for calculation: 0
Bad, bad factorial is too simple... A better challenge is needed....
No comments:
Post a Comment