node *insert(node *first,int data)
{node *temp,*trav,*cur;
temp->info=data;
temp->next=NULL;
trav=first;
if(data<trav->info)
{temp->next=first;
first=temp;
return first;
}
while(data>trav->info&&trav->next!=NULL)
{cur=trav;
trav=trav->next;
}
if(data>trav->info&&trav->next==NULL)
trav->next=temp;
else
{cur->next=temp;
temp->next=trav;
}
return first;
}

we can insert using binary search.

PLEASE INSERT IN SORTED ORDER....SO,THERE IS NO DIFICULTY OF
 RE-ARRANGING THE ELEMENTS...
  GOT IT...?
                           BY THE GREAT PROF.MUTHU
                           PH:9962940220

node *SLSortWiseInsert(node *START, int data)
{

        node *newnode;
        if(START == NULL)
        {
                START = (node *)malloc(sizeof(node));
                START->data = data;
                START->link = NULL;
                return START;
        }
        else if(data < START->data)
        {
                 newnode = (node *)malloc(sizeof(node));
                 newnode->data = data;
                 newnode->link = START;
                 return newnode;
        }
        else if((data > START->data) && (START->link == NULL))
        {
                printf("Inside this condition\n");
                newnode = (node *)malloc(sizeof(node));
                newnode->data = data;
                newnode->link = NULL;
                START->link = newnode;
                return START;
        }
        START->link = SLSortWiseInsert(START->link,data);
        return START;
}