sum of subset.c

#include<stdio.h>
 #define TRUE 1
 #define FALSE 0
 int inc[50],w[50],sum,n;
  int promising(int i,int wt,int total) 
 {
    return(((wt+total)>=sum)&&((wt==sum)||(wt+w[i+1]<=sum)));
 }
int main(void) 
{
    int i,j,n,temp,total=0;
    printf("\n Enter Numbet of elements in the set: ");
    scanf("%d",&n);
    for (i=0;i<n;i++) 
    {
        printf("\n Enter number %d: ",i+1);
        scanf("%d",&w[i]);
        total+=w[i];
    }
printf("\n Input the sum value to create sub set: ");
    scanf("%d",&sum);
    for (i=0;i<=n;i++)
    {
      for (j=0;j<n-1;j++)
      {
      if(w[j]>w[j+1]) 
       {
        temp=w[j];
        
        
        w[j]=w[j+1];
        w[j+1]=temp;
       }
      }
    }
    printf("\n Elements in sorted order: ",n);
    for (i=0;i<n;i++)
     {
      printf("%d \t",w[i]);
     }
    if((total<sum))
    {
      printf("\n Subset construction is not possible");
    }
      else 
      {
        for (i=0;i<n;i++)
           inc[i]=0;
        printf("\n The solution using backtracking is:\n");
        SumofSubSet(-1,0,total);
       }
    return 0;
}
 void SumofSubSet(int i,int wt,int total) 
 {
    int j;
    if(promising(i,wt,total)) 
    {
       
      if(wt==sum) 
        {
            printf("\n{\t");
            for (j=0;j<=i;j++)
                if(inc[j])
                 printf("%d\t",w[j]);
            printf("}\n");
        } 
        else 
        {
            inc[i+1]=TRUE;
            SumofSubSet(i+1,wt+w[i+1],total-w[i+1]);
            inc[i+1]=FALSE;
            SumofSubSet(i+1,wt,total-w[i+1]);
        }
    }
 }