[ad_1] Instead of comparing values pointed to by the pointers in statements like this if (n->me < curr->me) you are comparing pointers themselves. You should rewrite the condition like if ( *n->me < *curr->me ) [ad_2] solved insertion sort using linked list and pointers
[ad_1] l is pointing to the head of a linked list. So l is assigned NULL to start with, i.e. empty linked list. In the first iteration of the for-loop a node is created and assigned the value “06”. l is set to point to the newly created node. So you have: l —> (“06”, … Read more
[ad_1] main() { head = (node*)malloc(sizeof(node)); create(head); print(head); c = count(head); //See here you are sending the actual node, which is head. } int count(node* C_list) { if(C_list->next==NULL) //–>Here the if condition is checking for the next node (head->next) whether it is null or not. return(0); //–>If the next node is null, it means no … Read more