此程序用链表实现,比较简单.

#include
#include
#include
#define overflow -2
#define ture 1
#define False 0
typedef struct circle{
    int number;
    int password;
    struct circle *next;
}circle,*linkcircle;
void initcircle(linkcircle &l,int n)   /*初始化循环单链表*/
{  int i;  linkcircle p,newbase;
   newbase=(linkcircle)malloc(sizeof(circle));
   if(!newbase)  exit(overflow);
   p=l=newbase;
   printf("Input %d passwords:\n",n);
   for(i=1;i    {  scanf("%d",&p->password);
      if(p->password<1){
          printf("One password is error.\n");
          exit(0);
      }
      p->number=i;
      newbase=(linkcircle)malloc(sizeof(circle));
      if(!newbase)  exit(overflow);
      p->next=newbase;
      p=p->next;
  }
  scanf("%d",&p->password);
  p->number=i;
  p->next=l;
}
void sortcircle(linkcircle &l,int m)  /*排列函数*/
{  int i,change=ture;
   linkcircle p,q;
   p=l;
   printf("The result: ");
   m=m-1;
   while(change)  /* change为空表标志*/
   {  i=1;
      while(i       {  p=p->next;
         i++;
      }
      q=p->next;
      p->next=q->next;
      m=q->password;
      printf("%d ",q->number);
      if(q->next==q)
          change=False;
      free(q);
   }
   putchar('\n');
}
void main()
{  int n,m;
   linkcircle l;
   printf("Input the number of persons.\nn=");
   do{scanf("%d",&n);
      if(!n)  printf("Input error!\n");
      }while(!n);
   initcircle(l,n);
   printf("Input the limit.\nm=");
   scanf("%d",&m);
   sortcircle(l,m);
   getch();
}

评论