#include <iostream>
using namespace std;
class MergeSort {
private:
int* arr; // pointer to dynamic array
int size;
public:
MergeSort(int size) { // constructor to initialize private array and size
this->size = size;
arr = new int[size];
}
void merge(int* arr, int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int* arr, int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
void sort() { // public function to sort the private array
mergeSort(arr, 0, size - 1);
}
void display() { // public function to display the sorted array
cout << "Sorted array: ";
for (int i = 0; i < size; i++) {
cout << arr[i] << " ";
}
cout << endl;
}
~MergeSort() { // destructor to deallocate dynamic array memory
delete[] arr;
}
};
int main() {
int size;
cout << "Enter the size of the array: ";
cin >> size;
int* arr = new int[size];
cout << "Enter the elements of the array: ";
for (int i = 0; i < size; i++) {
cin >> arr[i];
}
MergeSort obj(size);
for (int i = 0; i < size; i++) {
obj.arr[i] = arr[i]; // copy the array to the private array in the class
}
obj.sort(); // sort the private array
obj.display(); // display the sorted array
delete[] arr; // deallocate dynamic array memory
return 0;
}