REVERSING A SLL.c

#include<stdio.h>
struct node
{
        int info;
        struct node *next;
};
struct node *start=NULL;
void create()
{
        struct node *temp,*ptr;
        temp=(struct node *)malloc(sizeof(struct node));
        if(temp==NULL)
        {
                printf("\nOut of Memory Space:\n");
                exit(0);
        }
        printf("\nEnter the data value for the node:\t");
        scanf("%d",&temp->info);
        temp->next=NULL;
        if(start==NULL)
        {
                start=temp;
        }
        else
        {
                ptr=start;
                while(ptr->next!=NULL)
                {
                        ptr=ptr->next;
                }
                ptr->next=temp;
        }
}
void display()
{
        struct node *ptr;
        if(start==NULL)
        {
                printf("\nList is empty:\n");
                return;
        }
        else
        {
                ptr=start;
                printf("\nThe List elements are:\n");
                while(ptr!=NULL)
                {
                        printf("#### value is %d #### ",ptr->info );
                        printf("location is %d #### pointing next to %d ####\n",ptr,ptr->next);
                        ptr=ptr->next ;
                }
        }
}
void reverse_list()
{
    struct node *cnode,*pnode,*nnode;
    cnode=start;
    pnode=start;
    nnode=start->next;
    cnode->next=NULL;
    while(nnode!=NULL)
    {
        pnode=cnode;
        cnode=nnode;
        nnode=nnode->next;
        cnode->next=pnode;
    }
    start=cnode;
}
int main()
{
    int n,i;
    printf("ENTER THE NUMBER OF NODES YOU WANT IN THE LIST :: \n");
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        create();
    }
    display();
    reverse_list();
    printf("AFTER REVERSING THE LIST:: ");
    display();
}