C / C++ / MFC

<br />
struct Node<br />
{<br />
       int data;<br />
       Node *next;<br />
};<br />
typedef struct Node Node;<br />
<br />
Node *Reverse(Node *head);<br />
<br />
Node *Merge(Node *head1, Node *head2)<br />
{<br />
     if (head1 == NULL)<br />
     return head2;<br />
     if (head2 == NULL)<br />
     return head1;<br />
     <br />
     Node *head = NULL;<br />
     Node *p1 == NULL;<br />
     Node *p2 == NULL;<br />
     <br />
     if (head1->data > head2->data)<br />
     {<br />
         head->next = head1;<br />
         p1 = head1->next;<br />
         p2 = head2;<br />
     }<br />
     <br />
     else<br />
     {<br />
         head->next = head2;<br />
         p1 = head1;<br />
         p2 = head2 -> data;<br />
     }<br />
     <br />
    // I want to see is that why some book in this step using  " Node *pcurrent =head"<br />
    //and I dont not know why,coould someone give me a detail, thanks in advantage!<br />
<br />
     while (p1!=NULL && p2!=NULL)<br />
     {<br />
     	if (p1->data > p2->data)<br />
     		{<br />
     			head->next =p1;<br />
     			head = p1;<br />
     			p1 = p1->next;<br />
     		}<br />
     	else<br />
     		{<br />
     			head -next = p2;<br />
     			head = p2;<br />
     			p2 = p2->next;<br />
     		}<br />
     }<br />
     <br />
     while (p1 != NULL)<br />
     {<br />
     		head->next = p1;<br />
     		head = p1;<br />
     		p1 = p2->next;<br />
    	}<br />
     while (p2 != NULL)<br />
     {<br />
     		head -next = p2;<br />
     		head = p2;<br />
     		p2 = p2->next;<br />
     }<br />
     return head;<br />
 }<br />

HINSTANCE ret = ShellExecute(NULL, "open", "http://www.google.com", NULL, NULL, SW_SHOWNORMAL);