各位好：下面是个循环单链表不正确的程序，谁能告诉我怎么改成循环链表，最好把代码告诉我，谢谢。
#include<stdio.h>
#include<stdlib.h>
typedef struct CLNode{
int data;
struct CLNode *next;
}CLnode,*CLinkList;

CLinkList CreateList(CLinkList L,int value);
void Output(CLinkList L);

int main(void)
{
CLinkList L=NULL;
int i,n,value;

printf("Please input n: ");
scanf("%d",&n);
for(i=1;i<=n;i++) //n代表结点数量
{
scanf("%d",&value);
L=CreateList(L,value); //创建程序
Output(L); //输出连表
}

return 0;
}

CLinkList CreateList(CLinkList L,int value)
{
CLinkList newPtr,previousPtr,currentPtr;

newPtr=(CLinkList)malloc(sizeof(CLnode));
if(newPtr)
{
newPtr->data=value;
newPtr->next=NULL;

previousPtr=NULL;
currentPtr=L;

while(currentPtr && currentPtr->data < value)
{
previousPtr=currentPtr;
currentPtr=currentPtr->next;

if(currentPtr==NULL) //这是我个人的想法，不对
previousPtr->next=L;
}
if(previousPtr==NULL)
{
newPtr->next=L;
L=newPtr;
}
else
{
previousPtr->next=newPtr;
newPtr->next=currentPtr;
}
}
else
printf("Dynamic malloc memory failure.\n");

return L;
}

void Output(CLinkList L)
{
CLinkList currentPtr;
if(L)
{
currentPtr=L;
while(currentPtr!=L)
{
printf("%d->",currentPtr->data);
currentPtr=currentPtr->next;
}
printf("NULL\n\n");
}
}

仍然谢谢你

#include<stdio.h>
#include<stdlib.h>
typedef struct CLNode
{
int data ;
struct CLNode*next ;
}
CLnode,*CLinkList ;

CLinkList CreateFirst(CLinkList FirstPtr,int value);
CLinkList InsertionNext(CLinkList L,int value);
void Output(CLinkList L);

int main(void)
{
CLinkList L=NULL ;
CLinkList FirstPtr=NULL ;
int i,n,value ;

printf("Please input n: ");
scanf("%d",&n);
scanf("%d",&value);
L=CreateFirst(FirstPtr,value);
Output(L);
//n代表结点数量
for(i=1;i<n;i++)
{
scanf("%d",&value);
L=InsertionNext(L,value);
//创建程序
Output(L);
//输出连表
}

return 0 ;
}
CLinkList CreateFirst(CLinkList FirstPtr,int value)
{

// CLinkList FirstPtr;

if(( FirstPtr=(CLinkList)malloc(sizeof(CLnode)))==NULL)
{
exit(0);
}
FirstPtr->data=value ;
FirstPtr->next=FirstPtr ;
return FirstPtr ;

}
CLinkList InsertionNext(CLinkList L,int value)
{
CLinkList NextPtr ;

if((NextPtr=(CLinkList)malloc(sizeof(CLnode)))==NULL)
{
exit(0);
}
NextPtr->data=value ;
NextPtr->next=L->next ;
L->next=NextPtr ;

return NextPtr ;
}
void Output(CLinkList L)
{
CLinkList currentPtr ;
if(L)
{
currentPtr=L ;
while(1)
{
printf("%d->",currentPtr->data);
if(currentPtr->next==L)break ;
currentPtr=currentPtr->next ;
}
printf("\n");
}
else printf("NULL\n\n");
}

#include<stdio.h>
#include<stdlib.h>
typedef struct CLNode{
int data;
struct CLNode *next;
}CLnode,*CLinkList;

CLinkList CreateList(int value);
void Output(CLinkList L);

int main(void)
{
CLinkList L=NULL;
int i,n;
printf("Please input n: ");
scanf("%d",&n);
L=CreateList(n); //创建程序
Output(L);
return 0;
}

CLinkList CreateList(int n)
{
int i=1;
CLinkList newPtr,previousPtr,currentPtr;
previousPtr=currentPtr=newPtr=(CLinkList)malloc(sizeof(CLnode));
printf("success\n");
printf("Input number:\n");
scanf("%d",&currentPtr->data);
printf("n=%d\n",n); // exit();
while(i<n)
{
i++;
currentPtr=(CLinkList)malloc(sizeof(CLnode));
printf("Input number:\n");
scanf("%d",&currentPtr->data);
previousPtr->next=currentPtr;
previousPtr=previousPtr->next;
}
currentPtr->next=newPtr; //指向第一个接点从而单循环链表创建成功
currentPtr=newPtr;
return newPtr;
}

void Output(CLinkList L)
{

CLinkList currentPtr,newPtr;
currentPtr=newPtr=L;
printf("The result is:\n");
printf("%d\n",currentPtr->data);
currentPtr=currentPtr->next;
while(currentPtr!=newPtr) //若从尾接点返回指向第一个接点就停止
{
printf("%d\n",currentPtr->data);
currentPtr=currentPtr->next;
}
}

俺将楼主的函数改了一部分,请谅解