几种常见的算法源代码C语言版1.回溯法(背包问题)#includeboolContains(intt,intn,intx[],intweight[],intmaxweight){intcountweight=0;for(inti=1;i<=t;i++){countweight+=x[i]*weight[i];}if(countweight<=maxweight)returntrue;elsereturnfalse;}boolBound(){returntrue;}voidBacktrack(intt,intn,intx[],intweight[],intvalue[],intmaxweight){if(t>n){intcountvalue=0;for(inti=1;i<=n;i++){countvalue+=x[i]*value[i];printf("%4d",x[i]);}printf("总价值为：%d\r\n",countvalue);}else{for(inti=0;i<=1;i++){x[t]=i;if(Contains(t,n,x,weight,maxweight)&&Bound())Backtrack(t+1,n,x,weight,value,maxweight);}}}voidmain(){intn,maxweight,a[50],weight[50],value[50];printf("请输入物品的总个数：");scanf("%d",&n);printf("\r\n请分别输入%d个物品的重量：\r\n",n);for(inti=1;i<=n;i++){scanf("%d",&weight[i]);}printf("请分别输入%d个物品的价值：\r\n",n);for(intj=1;j<=n;j++){scanf("%d",&value[j]);}printf("请输入背包所能容纳物品的最大重量：");scanf("%d",&maxweight);printf("\r\n");Backtrack(1,n,a,weight,value,maxweight);}2.全排列(未考虑重复元素)#includevoidSwap(int&a,int&b){inttemp;temp=a;a=b;b=temp;}voidPerm(intnum[],intk,intm){if(k==m){for(inti=0;i<=m;i++)printf("%4d",num[i]);printf("\n");}else{for(inti=k;i<=m;i++){Swap(num[k],num[i]);Perm(num,k+1,m);Swap(num[k],num[i]);}}}voidmain(){inta[100];printf("请输入要进行全排列的个数：\r\n");intn;scanf("%d",&n);for(inti=0;ivoidSwap(int&a,int&b){inttemp;temp=a;a=b;b=temp;}voidPerm(intnum[],intk,intm){if(k==m){for(inti=0;i<=m;i++)printf("%4d",num[i]);printf("\r\n");}else{for(inti=k;i<=m;i++){if(num[i]==num[k]&&i!=k)continue;else{Swap(num[i],num[k]);Perm(num,k+1,m);Swap(num[i],num[k]);}}}}voidmain(){inta[5];intm,n;printf("请输入要进行全排列的数的个数（不能超过5）：\r\n");scanf("%d",&m);printf("请输入%d个整数（可重复）：\r\n",m);for(inti=0;ivoidPrintComposition(intsource[],booltemplete[],intn){for(inti=0;i
