typedef struct Node{ int value; Node * next; }Node; void sort_n( Node *head,int flog){ int i=0,j=-1,t=-1; Node *p; Node *list[10]; for (i=0;inext=NULL; } p=head->next->next; i=0; while (i!=10) { while ((p->value)>=0) { if (flog ==1)