ProjectEuler/ProjectEulerCPP
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulercpp.git synced 2025-12-06 17:13:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated a few typos

Browse Source
This commit is contained in:
Mattrixwv
2020-07-09 01:45:02 -04:00
parent 6f55685f48
commit 780987991d
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
benchmark.hpp
View File

@@ -43,7 +43,7 @@ void printBenchmarkMenu(){
std::cout << "1. Run a specific problem\n"
<< "2. Run all problems that have a reasonably short run time\n"
<< "3. Run all problems\n"
<< "4. Exit the program" << std::endl;
<< "4. Exit the menu" << std::endl;
}
int getBenchmarkMenuSelection(){
@@ -93,7 +93,7 @@ void runSpecific(){
std::string timeResults = mee::Stopwatch::getStr(totalTime);
//Print the results
std::cout << "\n\n" << problem->getString();
std::cout << "\nIt took an average of " << timeResults << " to run this problem over " << timesToRun << " iterations\n\n" << std::endl;
std::cout << "\nIt took an average of " << timeResults << " to run this problem through " << timesToRun << " iterations\n\n" << std::endl;
}
void runAllShort(){
//Ask how many times to run the problem
@@ -102,7 +102,7 @@ void runAllShort(){
for(unsigned int cnt = 1;cnt < PROBLEM_NUMBERS.size();++cnt){
unsigned int problemNumber = PROBLEM_NUMBERS[cnt];
double totalTime = 0;
//If the problem number is contained the list of problems that take too long skip it
//If the problem number is contained in the list of problems that take too long skip it
if(mee::isFound(tooLong, problemNumber)){
continue;
}