void sortedinsert(struct node** headref, struct node* newnode) { struct node* current= *headref; if(newnode->data<current->data) { newnode->next=current; *headref=newnode; } else { current=current->next; while(current!=null) { if(newnode->data<current->next->data) break; current=current->next; } newnode->next=current->next; current->next=newnode; } }
consider case when insert @ end of list. get
// current = null current->next = nextnode; // ((struct node*)null)->next = nextnode;
Comments
Post a Comment