顺序打印N位数字

运用递归写了面试题的算法，感觉可以优化，希望大神帮看看

void Print(char *Number,int position,int N,int pos)
 {
   if(position>N-1)
      { 
       cout << Number+pos<<endl;
       if(*(Number+N-1) == '9')
       {
          
          char *pEnd =Number+N-1;
          *pEnd+=1;
        while(*pEnd == '9'+1)
        {
           *pEnd = '0';
           *(--pEnd)+=1;
          
        }
         if(pEnd >=Number+pos)
           cout << Number+pos << endl;
           else if(pEnd != Number-1)
               cout << pEnd << endl;
    
       }
       return;
     }
 
   for(int i = 1;i<=9;++i)
   {

        char p='0';
        Number[position] = i+p;
        Print(Number,position+1,N,pos);
        
   }
 
}

void PrintNumber(int n)
{
 if(0 == n)
     return;
    char *Number = new char[n+1];
 int i = 0;
 for(; i!=n; ++i)
     Number[i]='0';
     Number[i]='\0';
  for(int i = n-1; i >=0; --i)
  {
    
   Print(Number,i,n,i);
  
  }
  delete []Number;
}