Question

Instructions

C++ programming

Your task is to write a class called Data, stored in a file named Data.h. Your class should be able to store a collection (vector) of integers. In addition to the appropriate constructors, your class should also have the following methods.

void add (int number); Adds a number to the data set.

void print (); Prints out the entire data set on a single line, separated by space.

void sort (); Sorts the data set in ascending order. You may implement any sorting algorithm here, for example, max sort, bubble sort, insertion sort, merge sort, quick sort, etc... There is no need to try to implement the most efficient one, any one will do. You can look at http://en.wikipedia.org/wiki/Bubble_sort for implementation details of bubble sort.

Make sure your class works as expected with the file intSort.cpp.

File do not modify only for test.

#include <iostream>
#include "Data.h"

int main(int argc, const char * argv[])
{
    Data myData;
    
    myData.add(4);
    myData.add(5);
    myData.add(2);
    myData.add(3);
    myData.add(1);
    
    myData.print();
    
    myData.sort();
    
    myData.print();
    
    return 0;
}

the result output :

4 5 2 3 1
1 2 3 4 5

Answer 1

Please give thumbs up, If it is helpful for you. Thankyou!!

#include <iostream>
#include <vector>

class Data{
private:
       std::vector<int> arr;

public:
       void add(int num){
           arr.push_back(num);
       
       }

       void sort(){
               int j, temp;   
               for (int i = 0; i < arr.size(); i++){
               j = i;   
               while (j > 0 && arr[j] < arr[j-1]){
               temp = arr[j];
               arr[j] = arr[j-1];
               arr[j-1] = temp;
               j--;
               }
               }
       }
  
       void print(){
          
           for(int i=0;i<arr.size();i++)
              std::cout<<arr[i]<<" ";
           std::cout<<'\n';
       }
};

Code and output:

Terminal 4)6:00 PM Open ▼ Save Data.h intsort.cpp Untitled Document 1 1 #include <iostream> ! #include <vector» 4 class Data 5 private: std::vector<int> arr; 8 public: void add(int num) arr.push_back (num); vipul@vipul-desktop:-/sort vipul@vipul-desktop:~/sorts g++ intSort.cpp -o a vipul@vipul-desktop:/sort$ ./a 4 5 2 3 1 1 2345 vipul@vipul-desktop:-/sorts 13 14 15 16 17 18 19 20 21 void sort) int j, temp; for (inti-e; i <arr.size); i++) while (j && ar] arr[j-1]) temparr[j] arr[j]arr[j-1]; arrIj-1]temp; 23 24 25 26 27 28 29 30 31 void print) for(int i-0;i<arr.size();i++) 33 : 34 35 36 c/c++/ObjC HeaderTab Width: 4 Ln 36, Col 1 INS