10. Write a program for frame sorting technique used in buffers.
#include<stdio.h>
#include<string.h>
#define FRAM_TXT_SIZ 3
#define MAX_NOF_FRAM 12
char str[FRAM_TXT_SIZ* MAX_NOF_FRAM];
struct frame
{
 char text[FRAM_TXT_SIZ];
 int seq_no;
}
Fr[MAX_NOF_FRAM],shut_array[MAX_NOF_FRAM];
int assign_seq_no()
{
 int k=0,i,j;
 for(i=0;i<strlen(str);k++)
 {
 Fr[k].seq_no=k;
 for(j=0;j<FRAM_TXT_SIZ && str[i]=='\0';)
 Fr[k].text[j]=str[i++];
 }
 printf("\n After assigning sequence no:s\n");
 for(i=0;i<k;i++)
 printf("%d::%s",i,Fr[i].text);
 return k;
}
void generator(int *random_ary,const int limit)
{
 int r,i=0,j;
 while(i<limit)
 {
 r=random() %limit;
 for(j=0;j<i;j++)
 if(random_ary[j]==r)
 break;
 if(i==j)
 random_ary[i++]=r;
 }
}
void shuffle(const int no_frames)
{
 int i,k=0,random_ary[no_frames];
 
 generate(random_ary no_frames);
 for(i=0;i<no_frames;i++)
 shuf_ary[i]=fr[random_ary[i]];
 printf("\n \n After stuffing\n");
 for(i=0;i<no_frames;i++)
 printf("%d%r",shuf_ary[i],seq_no,shunt_ary[i],text);
}
}
void sort(const int no_frames)
{
 int i,j,flag=1;
 struct frame hold;
 for(i=0;i<no_frames-1 && flag==1)
 flag=0;
 for(j=0;j<no_frames-1-j;j++)
 {
 if(shuf_ary[j].seq_no>shuff_ary[j+1])
 {
 hold=shuf_ary[i];
 shuf_ary[j]=shuf_ary[j+1];
 shuf_ary[j+1]=hold;
 flag=1;
 }
 }
}
int main()
{
 int no_frames,i;
 printf("Enter the msg");
 gets(str);
 no_frames=assign_seq_no();
 shuffle(no_frames);
 sort(no_frames);
 printf("\n After sorting\n");
 for(i=0;i<no_frames;i++)
 printf("%s",shuff_ary[i].text);
 printf("\n\n");
 }
}