#include <iostream> #include <vector> using namespace std; void display(vector<int> a); void merge(vector<int> &a, int s, int e); void merge_sort(vector<int> &iArray, int s, int e); //The main function int main() { vector<int> iArray = {2, 5, 6, 4, 7, 2, 8, 3, 9, 10}; merge_sort(iArray, 0, iArray.size() - 1); //Print the sorted array display(iArray); return 0; } // Display a vector of ints void display(vector<int> a) { for (int i = 0; i < a.size(); i++) { cout << a[i] << " "; } cout << endl; } // The merge function void merge(vector<int> &a, int s, int e) { } //The recursive merge sort function void merge_sort(vector<int> &iArray, int s, int e) { }