Sorting a LinkedList

#include<stdio.h>
#include<stdlib.h>

struct node
{
    int data;
    struct node *next;
}*head;

int main()
{
    int n;
    printf("Enter total number of node: ");
    scanf("%d",&n);

    createList(n);

    printf("\nList is\n ");
    displaylist();

    sortlist(head);
    printf("\nSorted List is:\n");
    displaylist();

    return 0;
}
void createList(int n)
{
    struct node *p,*temp;
    int i,data;

    temp=(struct node *)malloc(sizeof(struct node));

    printf("Enter the data of the node 1: ");
    scanf("%d",&data);

    temp->data=data;
    temp->next=NULL;

    p=temp;
    head=temp;

    for(i=2; i<=n; i++)
    {
        temp=(struct node *)malloc(sizeof(struct node));

        printf("Enter the data of the %d: ",i);
        scanf("%d",&data);

        temp->data=data;
        temp->next=NULL;

        p->next=temp;
        p=p->next;

    }

}

void displaylist()
{
    struct node *temp;
    temp=head;

    while(temp!=NULL)
    {
        printf("\n%d",temp->data);
        temp=temp->next;
    }
}
void sortlist(struct node *head)
{

    struct node *i,*j;
    int temp;
    for (i=head; i->next!=NULL; i=i->next)
    {
        for(j=i->next; j!=NULL; j=j->next)
        {
            if(i->data>j->data)
            {
                temp=i->data;
                i->data=j->data;
                j->data=temp;
            }
        }
    }
}