C++ 归并排序（非递归）

    void Print_Ar(int* br, int n)
    {
    	if (br == NULL || n < 1)	return;
    	for (int i = 0; i < n; ++i)
    	{
    		cout << br[i] << " ";
    	}
    	cout << endl;
    }
    void Merge(int* src, int* dest, int left, int m, int right)
    {
    	int i = left;
    	int j = m + 1;
    	int k = left;
    	while (i <= m && j <= right)
    	{
    		dest[k++] = src[i] <= src[j] ? src[i++] : src[j++];
    	}
    	while (i <= m)
    	{
    		dest[k++] = src[i++];
    	}
    	while (j <= right)
    	{
    		dest[k++] = src[j++];
    	}
    }
    void Mer