Typedef strucf node {int data; struct node *next; }linknode,*link; Void Insertsort(link,L) {link p,q,r,u; p=L->next; (___1__) while(___2__) {=L; q=L->next; while((___3___)&&q->data<=p->data) {r=q;q=q->next:} u=p->next; (___4__) (___5__) p=u; } }
Typedef strucf node {int data; struct node *next; }linknode,*link; Void Insertsort(link,L) {link p,q,r,u; p=L->next; (___1__) while(___2__) {=L; q=L->next; while((___3___)&&q->data<=p->data) {r=q;q=q->next:} u=p->next; (___4__) (___5__) p=u; } }