Posts

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)         ...
Post a Comment
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...
Post a Comment
Read more

Map sort 5 with stack array and negative 16 bit numbers

#include <iostream> #include <vector> #include <map> #include <climits> using namespace std; #define MAP_SIZE USHRT_MAX #define OFFSET MAP_SIZE/2 void Map_sort(vector<int> &nums) {     vector<int> temp;     int arr[MAP_SIZE];     int maxElement = SHRT_MIN;     int minElement = SHRT_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]+OFFSET]++;              }     int j=0;     for(int i=minElement; i<= maxElement; i++ )     {  ...
Post a Comment
Read more

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) {      ...
Post a Comment
Read more

Map sort 3 with duplicates

#include <iostream> #include <vector> #include <map> #include <climits> using namespace std; void Map_sort(vector<int> &nums) {     vector<int> temp;     std::map<int,int> mp;     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];         }         mp[nums[i]]++;              }     int j=0;     for(int i=minElement; i<= maxElement; i++ )     {         if (mp[i] >= 1) {  ...
Post a Comment
Read more

Map sort 2

/****************************************************************************** Welcome to GDB Online. GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl, C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog. Code, Compile, Run and Debug online from anywhere in world. *******************************************************************************/ #include <iostream> #include <vector> #include <map> #include <climits> using namespace std; void map_sort(vector<int> &nums) {     vector<int> temp;     std::map<int,bool> mp;     int maxElement = INT_MIN;     int minElement = INT_MAX;     for(int i=0; i<nums.size(); i++)     {         if(maxElement < nums[i])         {             maxElement = nums[i];       ...
Post a Comment
Read more

Map sort

/****************************************************************************** Welcome to GDB Online. GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl, C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog. Code, Compile, Run and Debug online from anywhere in world. *******************************************************************************/ #include <iostream> #include <vector> #include <map> #include <climits> using namespace std; vector<int> map_sort(vector<int> &nums) {     vector<int> temp;     std::map<int,bool> mp;     int maxElement = INT_MIN;     int minElement = INT_MAX;     for(int i=0; i<nums.size(); i++)     {         if(maxElement < nums[i])         {             maxElement = nums[i];   ...
Post a Comment
Read more