merge sort in cpp

merg.cpp

#include <iostream>
using namespace std;
void ms(int *arr,int low,int mid,int high)
{
	int b[low+high];
	int i=low;
	int j=mid+1;
	int k=low;
	while(i<=mid && j<=high)
	{
		if (arr[i]<arr[j])
		{
			b[k]=arr[i];
			i++;
		}
		else
		{
			b[k]=arr[j];
			j++;
		}
		k++;
	}
	while(i<=mid)
	{	
		b[k]=arr[i];
		i++;
		k++;
	}
	while(j<=high)
	{
		b[k]=arr[j];
		j++;
		k++;
	}
	int p=low;
	while(p<k)
	{
		arr[p]=b[p];
		p++;
	}
}
void divide(int *arr,int low,int high)
{
	if(low<high)
	{
		int mid=(low+high)/2;
		divide(arr,low,mid);
		divide(arr,mid+1,high);
		ms(arr,low,mid,high);
	}
}
int main()
{
	int arr[]={5,6,8,9,1};
	divide(arr,0,5);
	for (int i = 0; i < 5; ++i)
	{
		cout<<arr[i]<<" ";
	}
	cout<<endl;
}