全排列（递归）

<cstdlib><iostream>const int size=3;


bool used[size];
int  array[size];
int  number[size]={1,2,3};
void print();
void fullarrange(int i)
{
     if(i==size)
     {
            print();
            return;
     }
      for(int k=0;k<size;k++)
      {
              if(!used[k])
              {
              used[k]=true;
              array[i]=number[k];
               fullarrange(i+1);
             used[k]=false;
              }
      }
}
void print()
{
     for(int i=0;i<size;i++)
       cout<<array[i]<<" ";
      
     cout<<endl;
 };
void init()
{
     for(int i=0;i<size;i++)
             used[i]=false;
 }

int main(int argc, char *argv[])
{
    init();
   
    fullarrange(0);
   
    system("PAUSE");
    return EXIT_SUCCESS;
}</iostream></cstdlib>

评论

2 楼 monsoonzeng 2007-05-25  

要这样贴代码

1 楼 monsoonzeng 2007-05-25  

h //int e;
public:
 E(int a,int b1,int c,int i,int l):C(a,b1),D(c,i),B(l){cout<<"make e"<<endl;}
 void show(){/*b:: show();*/cout<<"--show e"<<endl;}
};
void test(B s){s.show();}
int main()
{
  cout<<sizeof(A)<<","<<sizeof(B)<<","<<sizeof(C)<<","<<sizeof(D)<<","<<sizeof(E)<<endl;

        E e(1,2,3,4,5);
        cout<<e.C::b1<<"  "<<e.D::b1<<endl;
        return 0;