组合算法|C++实现

#include<stdlib.h>
#include<String.h>
#include<iostream.h>
inline void Swap(int*lhs,int*rhs){int tmp= *lhs; *lhs=*rhs; *rhs=tmp;}
void Reverse(int*beg,int*end){while(beg<end)Swap(beg++,--end);}
void Print(int*beg,int*end){while(beg!=end)cout<<*beg++<<' ';cout<<endl;}
inline int Cmp(const void*lhs,const void*rhs)
{return *(const int*)rhs - *(const int*)lhs;}
void Permutation(int* beg, int* mid, int* end)
{ int k(0),*p,*q;
  int i(2);
  if(end-mid > 1)
  qsort(mid,end - mid,sizeof(int),Cmp);Print(beg,mid);
  int* nav = end - 1; 
 while(i)
 {     
   int* tmp = nav; 
   if(*--nav < *tmp) 
   { 
  int* rmbt = end; 
          while(*--rmbt <= *nav)
  if(rmbt==mid)
  {
  Swap(nav,tmp);
  nav--;
  rmbt = end;
  }
          Reverse(nav, rmbt+1);
  qsort(mid, end - mid, sizeof(int), Cmp);
          Print(beg, mid);