Map sort 4 with array version

#include <iostream>
#include <vector>
#include <map>
#include <climits>
using namespace std;

void Map_sort(vector<int> &nums)
{
    vector<int> temp;
    int arr[20000];
    int maxElement = INT_MIN;
    int minElement = INT_MAX;
    for(int i=0; i<nums.size(); i++)
    {
        if(maxElement < nums[i])
        {
            maxElement = nums[i];
        }
        if(minElement > nums[i])
        {
            minElement = nums[i];
        }
        arr[nums[i]]++;
        
    }
    int j=0;
    for(int i=minElement; i<= maxElement; i++ )
    {
        if (arr[i] >= 1) { 
            for (int count = 0; count < arr[i]; count++) 
            { 
                nums[j++] = i;
            }
        }
    }
    
}

int main()
{
    vector<int> nums{89, 77, 66, 55, 33, 44, 22, 11, 89 };
    Map_sort(nums);
    for(auto &x: nums)
    {
        cout << x<< " ";
    }
    
    return 0;
}  

Comments

Post a Comment

Popular posts from this blog

VECPP.c

#include <tape_t.h> #include <string_t.h> #include <tuple_t.h> #include <bool_t.h> /**** first design #include, #define VAR, #define FUNC() and #ifdef, #elif and #endif *****/ enum MacroType {     define_t,     include_t,     line_t,     undef_t,     error_tt,     pragma_t,     defined_t,     if_t,     ifdef_t,     ifndef_t,     elif_t,     else_t,     endif_t,     COMPILER_DATA,     UNDEFINED,     MAX_TYPE }; MacroType getIndexFromStr(string_t s) {     string_t tmp;     char* arr[13] = { "define","include","line","undef","error","pragma","defined","if","ifdef","ifndef","elif","else","endif" };     for(int i=0; i< 13; i++)     {         tmp = string(arr[i]);         if((compare(tmp,s)) == 0)         ...
Read more

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...
Read more

Interview questions

Orion Innovations class A {           public:     A()     {         printf("A def ctor\n");     }     ~A()     {         printf("~A def dector\n");     }     char ac; }; static A statObject; int main() {     printf("Size of A = %d\n", sizeof(A));     printf("main()\n"); } //===================== //output: here // A def ctor Size of A = 1 main() ~A def dector struct A {     A() { cout << "A" << endl; }     ~A() { cout << "~A" << endl; } }; struct B {     B() { cout << "B" << endl; }     ~B() { cout << "~B" << endl; } }; struct D {     D( D& d ) { cout << "&D" << endl; }     D() { cout << "D" <...
Read more