Question

In C++ write a class. The requirements for the class are define as followings:

• Class StudentMergeSorter – This class will have the following methods with their signatures as listed below:
  • Sort()
    • Java - This method will receive an array of Student records to be sorted. It will sort the records by Student ID(s). It will also return the sorted array of Student records.
    • C++ - This method will have two parameters. The first parameter will be an array of Student records to be sorted. The second parameter will be the number of Student records in the array.
  • PrintRecords()
    • Java - This method will receive an array of Student records. It will print out the information of each Student record.
    • C++ - This method will have two parameters. The first parameter will be an array of Student records to be printed. The second parameter will be the number of Student records in the array.

Answer 1

ANSWER :

#include<iostream>
#include<bits/stdc++.h>

using namespace std;

class StudentQuickSorter
{
public:

void PrintRecords(int arr[], int n) //method to print all the records
{
cout<<"PRINTING THE RECORDS:"<<endl;
for(int i=0;i<n;i++)
{
cout<<arr[i]<<endl;
}
}

void swap(int *n1, int *n2) // method to swap two numbers, it is used in quick sort implementation
{
int temp;
temp = *n1;
*n1 = *n2;
*n2 = temp;
}

int partition_function(int arr[], int l, int h)  // method implementing partition function
{
int pivot, index, i;
index = l;
pivot = h;
for(i=l; i < h; i++)
{
if(arr[i] < arr[pivot])
{
swap(&arr[i], &arr[index]);
index++;
}
}
swap(&arr[pivot], &arr[index]);

return index;
}

int pivot_partition_function(int arr[], int l, int h)  //method to genereate random pivot partition
{
int pvt, n, temp;
n = rand();
pvt = l + n%(h-l+1);
swap(&arr[h], &arr[pvt]);

return partition_function(arr, l, h);
}

int Quick_sort_function(int arr[], int l, int h)  // quicksort function implementation
{
int pindex;
if(l < h)
{
pindex = pivot_partition_function(arr, l, h); //finding partition for divding input array
Quick_sort_function(arr, l, pindex-1); // dividing input array into parts to get efficient tiem complexity
Quick_sort_function(arr, pindex+1, h);
}
return 0;
}

void Sort(int arr[],int n) // Sort method to sort the records using quicksort algorithm
{
Quick_sort_function(arr,0,n-1);
cout<<"RECORDS SORTED"<<endl;
}
};

int main()
{
int n;
cout<<"Enter the number of students record to be added in the array: "<<endl;
cin>>n;
cout<<"Enter "<<n<<" records now: "<<endl;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
StudentQuickSorter object;
object.Sort(arr,n);
object.PrintRecords(arr,n);
return 0;
}

CODE IMAGE: