#include using namespace std; /* This code is in response to a question posted by Athena * https://www.sololearn.com/Discuss/2644069/is-there-a-way-to-count-repetition-without-an-array * * The requirement is to accept 100 numbers in the range of 0 to 20 * and determine the number that occurs at the highest frequency * without the use of arrays or other collection classes. * * I can only assume that the purpose of this homework question * is to demonstrate a point with a follow up lesson that does the * same thing but using arrays. * * Note: No attempt has been made to perform error detection or * correction of user input. It is assumed that all entries will be * integers. Test Data for sololearn: 0 0 0 0 0 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 5 6 6 6 6 6 7 7 7 8 8 8 9 9 9 10 10 10 10 10 10 10 10 11 11 11 11 12 12 12 12 13 13 13 13 14 14 14 14 14 14 14 14 14 14 15 15 15 15 16 16 16 16 17 17 17 17 18 18 18 18 19 19 19 19 20 20 20 20 20 */ int main(){ // Declare variables int count00 = 0, count01 = 0, count02 = 0, count03 = 0, count04 = 0; int count05 = 0, count06 = 0, count07 = 0, count08 = 0, count09 = 0; int count10 = 0, count11 = 0, count12 = 0, count13 = 0, count14 = 0; int count15 = 0, count16 = 0, count17 = 0, count18 = 0, count19 = 0; int count20 = 0; int maxcount = 0, maxnumber; int number; for(int i=0; i<100; i++){ // Get user input cin >> number; // Count occurrances switch (number) { case 0: count00++; break; case 1: count01++; break; case 2: count02++; break; case 3: count03++; break; case 4: count04++; break; case 5: count05++; break; case 6: count06++; break; case 7: count07++; break; case 8: count08++; break; case 9: count09++; break; case 10: count10++; break; case 11: count11++; break; case 12: count12++; break; case 13: count13++; break; case 14: count14++; break; case 15: count15++; break; case 16: count16++; break; case 17: count17++; break; case 18: count18++; break; case 19: count19++; break; case 20: count20++; break; default: cout << "Number is not between 0 and 20" << endl; break; } // End of switch } // End of input loop // Now determine the most frequent number if(count00 > maxcount){ maxcount = count00; maxnumber = 0; } if(count01 > maxcount){ maxcount = count01; maxnumber = 1; } if(count02 > maxcount){ maxcount = count02; maxnumber = 2; } if(count03 > maxcount){ maxcount = count03; maxnumber = 3; } if(count04 > maxcount){ maxcount = count04; maxnumber = 4; } if(count05 > maxcount){ maxcount = count05; maxnumber = 5; } if(count06 > maxcount){ maxcount = count06; maxnumber = 6; } if(count07 > maxcount){ maxcount = count07; maxnumber = 7; } if(count08 > maxcount){ maxcount = count08; maxnumber = 8; } if(count09 > maxcount){ maxcount = count09; maxnumber = 9; } if(count10 > maxcount){ maxcount = count10; maxnumber = 10; } if(count11 > maxcount){ maxcount = count11; maxnumber = 11; } if(count12 > maxcount){ maxcount = count12; maxnumber = 12; } if(count13 > maxcount){ maxcount = count13; maxnumber = 13; } if(count14 > maxcount){ maxcount = count14; maxnumber = 14; } if(count15 > maxcount){ maxcount = count15; maxnumber = 15; } if(count16 > maxcount){ maxcount = count16; maxnumber = 16; } if(count17 > maxcount){ maxcount = count17; maxnumber = 17; } if(count18 > maxcount){ maxcount = count18; maxnumber = 18; } if(count19 > maxcount){ maxcount = count19; maxnumber = 19; } if(count20 > maxcount){ maxcount = count20; maxnumber = 20; } // Display the result cout << endl; cout << "The most frequent number is " << maxnumber << " which occurs " << maxcount << " times." << endl; return 0; }

Most Frequent Number