c語言實現全排序

來源:互聯網
上載者:User
//input 8 12.61s consumed   //input 8 11.72s consumed remove '-' in the printed array   #include <stdio.h>   #include <string.h>   #include <stdlib.h>   #define LENGTH 27   int n=0;   void permute(int[],int,int);   void swapint(int &a,int &b);   void printIntArray (int[],int);   //Function Implementation   void swapint(int &a,int &b){       int temp;       temp = a;       a = b;       b = temp;   }   void printIntArray(int target[],int length){       int i;       for (i=0;i<length;i++) printf ("%d",target[i]);       printf ("\n");   }   void permute(int target[],int begin,int end){           if (begin==end) {           printIntArray(target,end+1);           n++;           return;       }       int i;       for (i=begin;i<=end;i++){                   swapint(target[begin],target[i]);           permute(target,begin+1,end);           swapint(target[begin],target[i]);                       }   }   //test Functions   void testPermute(){       int len;       scanf ("%d",&len);           int *testcase =(int *)malloc(len*sizeof(int));           int i;       for (i=0;i<len;i++) testcase[i]=i+1;       permute(testcase,0,len-1);       }   //Main Function   void main(){       testPermute();       printf ("n=%d",n);   }  

z_yd@tom.com

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.