Sorting An array with c++

Follow the codes format below! thanks so much if you can help me with this!!!!!!!!!

#include <iostream>

#include <stdlib.h>

#include <string>

using namespace std;

void MyFunc ( int *array ) {

// …

}

int main(int argc,char **argv) {

int *Sequence;

int arraySize;

// Get the size of the sequence

cin >> arraySize;

// Allocate enough memory to store “arraySize” integers

Sequence = new int[arraySize];

// Read in the sequence

for ( int i=0; i<arraySize; i++ )

cin >> Sequence[i];

// Run your algorithms to manipulate the elements in Sequence

MyFunc(Sequence);

// Output the result

for(int i=0; i<arraySize; i++)

cout << Sequence[i] << endl;

// Free allocated space

delete[] Sequence;

}

Show transcribed image textSorting by combining merge- and insertion-sort Description We combine two sorting algorithms, insertion-sort and merge-sort as follows: when the input size is less than 100, we use insertion-sort; otherwise, we use merge-sort. More specifically, we replace line 1 in Merge-Sort (page 34) with “If r-p >= 100”, and add line 6 else Insertion-Sort(A, p, r). Insertion-Sort(A, p, r) implies performing insertion sort on the subarray Alpr. In this lab assignment you will implement this hybrid sorting algorithm.