# MergeSort - Is this actually MergeSort?

Will this code actually work as MergeSort? This is working to sort the array but is it MergeSort?

My faculty did approve of this but he probably did not see the code properly and I need some serious help here.

#include<iostream>
using namespace std;
int mid;
int array[8]={98, 23, 45, 14, 6, 67, 33};

void msort(int s, int e)
{
if (s<e) {
mid = (s + e) / 2;
msort(s, mid);
msort(mid + 1, e);

}

for(int i=s;i<=e;++i)
{
for(int j=i+1;j<=e;++j)
{
if(array[i]>array[j])
{
array[i] = array[i]+array[j];
array[j] = array[i]-array[j];
array[i] = array[i]-array[j];
}
}
}
}

int main() {
msort(0, 7);

for (int i=0; i<8; i++)
{
cout<<"\t"<<a[i];
}
}