Create a single linked list in the data structure and sort it in ascending order

there is no error in compilation after being written using the following method, but the execution result has always been: 2pint 2pint 2pens 1966080, solve!

LNode s (LNode head1,int n) {int iLecture s; LNode p, s, head2; head2= (LNode ) malloc (sizeof (LNode)); head2- > next=NULL; for (IPP) {for (j < n Tech JPP) {if ((pendi)-> data > (Prunj)-> data) {s = (LNode*) malloc (sizeof (LNode));) S-> data= (pamphj)-> data; s-> next=head2- > next; head2- > next=s;} return head2;}

Mar.01,2021
MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-1b317f4-2bdc8.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-1b317f4-2bdc8.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?