// this is just a efforr to show how efficiency of sorting by counting sort is far better than sorting provided by algorithm // run code and observe that default sorting is faster // increase input size to 10000 from 100 by changing just value of CNT //observe that counting sort is faster now #include #include #include #include #include using namespace std; using namespace chrono; const int CNT = 100; const int MAX = 10; class Timer { time_point start; public: Timer() { start = high_resolution_clock::now(); } ~Timer() { time_point end = high_resolution_clock::now(); auto a = duration_cast(end - start); cout << a.count() << " ms" << endl; } }; void CountingSort(vector& vecInput) { vector vecCnt(MAX,0); //count of unique elements for(const auto& elem:vecInput) vecCnt[elem]++; /*cout << endl << endl; for(const auto& elem:vecCnt) cout << elem << " "; */ //count of unique elements : cummulative for(int i=1;i vecTemp(CNT); for (int i = CNT - 1; i >= 0; i--) { vecTemp[vecCnt[vecInput[i]] - 1] = vecInput[i]; vecCnt[vecInput[i]]--; } vecInput = vecTemp; } void Sorting1() { vector vecInput(CNT); srand(time(nullptr)); for(int i=0;i vecInput(CNT); srand(time(nullptr)); for(int i=0;i