归并排序算法C++代码

#include<iostream>
#include<vector>
using namespace std;
void merge(vector<int>nums,int l,int m,int r)
{
	vector<int> lnums,rnums;
	for(int i=l;i<m;i++)
	lnums[i-l]=nums[i];
	for(int i=m;i<=r;i++)
	rnums[i-m]=nums[i];
	int i=0,j=0,k=l;
	while(i<lnums.size() && j<rnums.size())
	{
		if(lnums[i]<rnums[j])
		nums[k++]=lnums[i++];
		else
		nums[k++]=rnums[j++];
		while(i<lnums.size())
		nums[k++]=lnums[i++];
		while(j<rnums.size())
		nums[k++]=rnums[j++];
	}
 } 
 void merge_sort(vector<int>nums,int l,int r)
 {
 	if(l==r)
 	return;
 	int m=(l+r)/2;
 	merge_sort(nums,l,m);
 	merge_sort(nums,m+1,r);
 	merge(nums,l,m+1,r);
 }
 void prin(vector<int>nums)
 {
 	for(int i=0;i<nums.size();i++)
	cout<<nums[i]<<endl;
 }
 int main()
 {
 	vector<int>nums;
 	while(cin.get()!='\n')
 	{
		int i;
		cin>>i;
		nums.push_back(i);
	 }
	 int l=0,r=nums.size()-1;
	 merge_sort(nums,l,r);
	 prin(nums);
	 return 0;
	 
 }