Update Merge Sort.cpp

Author: potter1024

13- Linked Lists/Merge Sort.cpp

@@ -1,3 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+struct node{
+    int data;
+    node* next;
+};
+void insert(int data,node** head){
+    if(*head==NULL){
+        node* n=new node;
+        n->data=data;
+        n->next=NULL;
+        *head=n;
+        return;
+    }
+    node* current=*head;
+    while(current->next!=NULL){
+        current=current->next;
+    }
+    node* n=new node;
+    n->data=data;
+    n->next=NULL;
+    current->next=n;
+}
+void print(node* head){
+    node* current=head;
+    while(current!=NULL){
+        cout<<current->data<<" ";
+        current=current->next;
+    }
+    cout<<endl;
+}
 node* split(node* head){
     node* hare=head;
     node* tortoise=head;
@@ -36,5 +67,17 @@ node* mergeSort(node* head){
     if(!head || head->next==NULL){
         return head;
     }
-    return converge(mergeSort(split(head)),mergeSort(head));
+    node* node1=head;
+    node* node2=split(head);
+    return converge(mergeSort(node1),mergeSort(split(head)));
+}
+int main(){
+    node* head=NULL;
+    insert(2,&head);
+    insert(4,&head);
+    insert(3,&head);
+    insert(1,&head);
+    print(head);
+    head=mergeSort(head);
+    print(head);
 }