Question

In addition to these 10 functions, you'll have 6 more functions void incDouble(double al], unsigned els); incDouble's job is to sort the array so that the values are in increasing order void decDouble(double al], unsigned els); decDouble's job is to sort the array so that the values are in decreasing order void inc Vec(vector<double> & v); incVec's job is to sort the vector so that the values are in increasing order void decVec(vector<double> & v); decVec's job is to sort the vector so that the values are in decreasing order void weirdVec(vector<double> & v); weirdVec's job is to sort the vector so that: All the #'s that are < -I come before all the #'s that are All the #'s that are in the range (-1, 1) come before all the #'s that are >-| The #'s that are <=-1 are put in decreasing order The #'s that are in the range (-1,1) are put in decreasing order The #'s that are >-1 are put in decreasing order For example, if the vector held {7, 3, .5, -2, -4, .2, .7, -1, 3} on entry, then it would hold (-1, -2, -4, .7, .5,.2, 7, 3, 3} on exit. int mainO Write a valid main. You decide the details of your main. To nO Notifications
can anyone help me with this 6 function as c++ language. It is not required to return in main.

Answer 1

//C++ program

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

void incDouble(double a[] , unsigned els){
   for(int i=els-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(a[j]>a[j+1]){
               double temp=a[j];
               a[j]=a[j+1];
               a[j+1]=temp;
           }
       }
   }
}
void decDouble(double a[] , unsigned els){
   for(int i=els-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(a[j]<a[j+1]){
               double temp=a[j];
               a[j]=a[j+1];
               a[j+1]=temp;
           }
       }
   }
}
void incVec(vector<double> &v){
   int els=v.size();
   for(int i=els-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(v[j]>v[j+1]){
               double temp=v[j];
               v[j]=v[j+1];
               v[j+1]=temp;
           }
       }
   }
}

void decVec(vector<double> &v){
   int els=v.size();
   for(int i=els-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(v[j]<v[j+1]){
               double temp=v[j];
               v[j]=v[j+1];
               v[j+1]=temp;
           }
       }
   }
}

void weiredVec(vector<double>&v){
   incVec(v);
   int countless =0, equal =0,greater=0;
  
   for(int i=0;i<v.size();i++){
       if(v[i]<=-1)countless++;
       if(v[i]>-1 &&v[i]<1)equal++;
       else greater++;
   }
  
   int i=0,j=countless-1;
   while(i<j){
       double temp=v[j];
               v[j]=v[i];
               v[i]=temp;
               i++;
               j--;
   }
   i=countless;
   j=countless+equal-1;
   while(i<j){
       double temp=v[j];
               v[j]=v[i];
               v[i]=temp;
               i++;
               j--;
   }
   i=countless+equal;j=v.size()-1;
   while(i<j){
       double temp=v[j];
               v[j]=v[i];
               v[i]=temp;
               i++;
               j--;
   }
}

int main(){
   vector<double> vec;
   double arr[] = {7,3,0.5,-2,-4,.2,.7,-1,3};
   for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)vec.push_back(arr[i]);
   weiredVec(vec);
  
   for(int i=0;i<vec.size();i++)cout<<vec[i]<<" ";
   return 0;
}