#include #include #include using namespace std; // find out mode of input data... // If data is 6,1,2,4,5; mode should be 1 as all element are present only once and among them, one is smallest // If data is 2,3,2,5,1,5,8,9,6,5; mode should be 5. struct structFreq { int intData; int intFreq; }; bool compareFrequency(const structFreq &a, const structFreq &b) { if(a.intFreq==b.intFreq ) return a.intData < b.intData; return a.intFreq > b.intFreq; } int main() { // input for which mode is to be found vector vecInput {2,6,8,1,9,4,3,5,7,9}; vector vecFreq; structFreq objTemp; objTemp.intData = vecInput[0]; objTemp.intFreq = 1; vecFreq.push_back(objTemp); //size of input data int intVecSize = vecInput.size(); //loop through all input data for(int iCur=1;iCur < intVecSize ;++iCur) { int intInput = vecInput[iCur]; //size of data vector int intDataSize = vecFreq.size(); int intToAddAt = -1; for(int iCurData=0;iCurData < intDataSize ;++iCurData) { if(vecFreq[iCurData ].intData == intInput ) { structFreq objTemp; objTemp.intData = intInput ; objTemp.intFreq = vecFreq[iCurData ].intFreq + 1; vecFreq.erase(vecFreq.begin()+iCurData); vecFreq.push_back(objTemp); intToAddAt = 99; break;// break loop of data } } // add if not found if(intToAddAt==-1) { structFreq objTemp; objTemp.intData = intInput; objTemp.intFreq = 1; vecFreq.push_back(objTemp); } } //sort data sort(vecFreq.begin(),vecFreq.end(),compareFrequency); cout<< vecFreq[0].intData ; return 0; }

ModeOfData