//I think it can be implemented this way rather
simply..check it..

main(){
       char a[15];
       int len,fiblen,i,j,count=0,div,on,to;
       printf("enter the string\n");
       scanf("%s",a);
        fiblen=fib(strlen(a));
        div=fiblen/(strlen(a));
        for(i=0;i<strlen(a);i++){
          for(j=0;j<(strlen(a)-1);j++){
             for(on=1;on<(strlen(a)-1);on++){ 
             to=on+1;        
             swap(&a[on],&a[to]);
             count++;//no: of anagram
             printf("(%d) %s\n",count,a);
             }
          }
             swap(&a[0],&a[i+1]);
        }
 }
       swap(char *a,char *b){
        char temp=*a;
        *a=*b;
        *b=temp;
       }
   int fib(int a){
   if(a==1)
   return(1);
   else
   return(a*fib(a-1));
   }