Merge pull request #89 from sahilahmed24/main

Resolved Issue #49

Author: Gauravsharma-20

Good-First-Issues/Merge_Sort_for_Linked Lists.cpp

@@ -0,0 +1,112 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct Node{
+	int data;
+	Node *next;
+};
+
+void insert(int x,Node **head) {
+	if(*head == NULL){
+		*head = new Node;
+		(*head)->data = x;
+		(*head)->next = NULL;
+		return;
+	}
+	Node *temp = new Node;
+	temp->data = (*head)->data;
+	temp->next = (*head)->next;
+	(*head)->data=x;
+	(*head)->next=temp;
+}
+
+
+void print(Node *head) {
+	Node *temp=head;
+	while(temp!=NULL) {
+		cout<<temp->data<<" ";
+		temp = temp->next;
+	}
+}
+
+Node *merge(Node *firstNode,Node *secondNode) {
+	Node *merged = new Node;
+	Node *temp = new Node;
+	
+
+	merged = temp;
+
+
+	while(firstNode != NULL && secondNode != NULL) {
+	
+		if(firstNode->data<=secondNode->data) {
+			temp->next = firstNode;
+			firstNode = firstNode->next;
+		}
+		
+		else {
+			temp->next = secondNode;
+			secondNode = secondNode->next;
+		}
+		temp = temp->next;
+	}
+	
+	while(firstNode!=NULL) {
+		temp->next = firstNode;
+		firstNode = firstNode->next;
+		temp = temp->next;
+	}
+
+	while(secondNode!=NULL) {
+		temp->next = secondNode;
+		secondNode = secondNode->next;
+		temp = temp->next;
+	}
+
+	return merged->next;
+}
+
+
+Node *middle(Node *head) {
+	Node *slow = head;
+	Node *fast = head->next;
+	
+	while(slow->next != NULL && (fast!=NULL && fast->next!=NULL)) {
+		slow = slow->next;
+		fast = fast->next->next;
+	}
+	return slow;
+}
+
+
+Node *sort(Node *head){
+	
+	if(head->next == NULL) {
+		return head;
+	}
+
+	Node *mid = new Node;
+	Node *head2 = new Node;
+	mid = middle(head);
+	head2 = mid->next;
+	mid->next = NULL;
+	
+	Node *finalhead = merge(sort(head),sort(head2));
+	return finalhead;
+}
+int main(void) {
+	Node *head = NULL;
+	
+    int n;
+    cin>>n;
+
+    int arr[n];
+    for(int i=0; i<n; i++){
+        cin>>arr[i];
+    }
+	for(int i=0;i<n;i++) {
+		insert(arr[i],&head);
+	}
+	print(sort(head));	
+	return 0;
+}