How to merge two single linked list using c?

Answer 1

Here is the java version, C should be similar

// merges two Singly linked lists A and B, both sorted in increasing order of integers .

// Return a Singly linked list sorted in increasing order

// for ex if A = 1->2->3->6 and B = 2->4->7, returns 1->2->2->3->4->6->7

public LinkedList merge(LinkedList A, LinkedList B) {

Node 1A = A.head;

Node 1B = B.head;

Node P1A = NULL;

Node 2A = NULL;

Node 2B = NULL;

while ( 1A != NULL && 1B !=NULL){

2A = 1A.next;

2B = 1B.next;

if (1A.item >= 1B.item) {

if (P1A != NULL) {

P1A.next = 1B;

}

else if ( P1A == NULL){

P1A = 1B;

}

1B.next = 1A;

P1A = 1B;

1B = 2B;

}

else if ( 1A.item < 1B.item){

if ( 2A != NULL) {

P1A = 1A;

1A = 1A.next;

}

else{

1A.next = 1B;

break;

}

}

}

return A;

}