Comparision with Quick Sort
#include <iostream> #include <vector> #include <map> #include <climits> #include <chrono> // Added for timing using namespace std; using namespace std::chrono; // Added for chrono #define MAP_SIZE USHRT_MAX #define OFFSET MAP_SIZE/2 void Map_sort(vector<int> &nums) { vector<int> temp; int arr[MAP_SIZE] = {0}; int maxElement = SHRT_MIN; int minElement = SHRT_MAX; for(int i=0; i<nums.size(); i++) { if(nums[i] > maxElement) maxElement = nums[i]; if(nums[i] < minElement) minElement = nums[i]; arr[nums[i]+OFFSET]++; } int j=0; for(int i=minElement; i<= maxElement; i++) { if(arr[i+OFFSET] >= 1) { for(int coun...