Merge Sort for Linked Lists in JavaScript Last Updated : 30 Mar, 2023 Comments Improve Suggest changes Like Article Like Report Prerequisite: Merge Sort for Linked Lists Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible. In this post, Merge sort for linked list is implemented using JavaScript. Examples: Input : 5 -> 4 -> 3 -> 2 -> 1Output :1 -> 2 -> 3 -> 4 -> 5 Input : 10 -> 20 -> 3 -> 2 -> 1Output : 1 -> 2 -> 3 -> 10 -> 20 Implementation: javascript <script> // Create Node of LinkedList function Node(data) { this.node = data; this.next = null; } // To initialize a linkedlist function LinkedList(list) { this.head = list || null } // Function to insert The new Node into the linkedList LinkedList.prototype.insert = function(data) { // Check if the linked list is empty // so insert first node and lead head // points to generic node if (this.head === null) this.head = new Node(data); else { // If linked list is not empty, insert the node // at the end of the linked list let list = this.head; while (list.next) { list = list.next; } // Now here list pointer points to last // node let’s insert out new node in it list.next = new Node(data) } } // Function to print linkedList LinkedList.prototype.iterate = function() { // First we will check whether out // linked list is empty or node if (this.head === null) return null; // If linked list is not empty we will // iterate from each Node and prints // it’s value store in “data” property let list = this.head; // we will iterate until our list variable // contains the “Next” value of the last Node // i.e-> null while (list) { document.write(list.node) if (list.next) document.write(' -> ') list = list.next } } // Function to mergesort a linked list LinkedList.prototype.mergeSort = function(list) { if (list.next === null) return list; let count = 0; let countList = list let leftPart = list; let leftPointer = list; let rightPart = null; let rightPointer = null; // Counting the nodes in the received linkedlist while (countList.next !== null) { count++; countList = countList.next; } // counting the mid of the linked list let mid = Math.floor(count / 2) let count2 = 0; // separating the left and right part with // respect to mid node in the linked list while (count2 < mid) { count2++; leftPointer = leftPointer.next; } rightPart = new LinkedList(leftPointer.next); leftPointer.next = null; // Here are two linked list which // contains the left most nodes and right // most nodes of the mid node return this._mergeSort(this.mergeSort(leftPart), this.mergeSort(rightPart.head)) } // Merging both lists in a sorted manner LinkedList.prototype._mergeSort = function(left, right) { // Create a new empty linked list let result = new LinkedList() let resultPointer = result.head; let pointerLeft = left; let pointerRight = right; // If true then add left most node value in result, // increment left pointer else do the same in // right linked list. // This loop will be executed until pointer's of // a left node or right node reached null while (pointerLeft && pointerRight) { let tempNode = null; // Check if the right node's value is greater than // left node's value if (pointerLeft.node > pointerRight.node) { tempNode = pointerRight.node pointerRight = pointerRight.next; } else { tempNode = pointerLeft.node pointerLeft = pointerLeft.next; } if (result.head == null) { result.head = new Node(tempNode) resultPointer = result.head } else { resultPointer.next = new Node(tempNode) resultPointer = resultPointer.next } } // Add the remaining elements in the last of resultant // linked list resultPointer.next = pointerLeft; while (resultPointer.next) resultPointer = resultPointer.next resultPointer.next = pointerRight // Result is the new sorted linked list return result.head; } // Initialize the object let l = new LinkedList(); l.insert(10) l.insert(20) l.insert(3) l.insert(2) l.insert(1) // Print the linked list l.iterate() // Sort the linked list l.head = LinkedList.prototype.mergeSort(l.head) document.write('<br> After sorting : '); // Print the sorted linked list l.iterate() </script> Output 10 -> 20 -> 3 -> 2 -> 1 After sorting : 1 -> 2 -> 3 -> 10 -> 20 Complexity Analysis: Time Complexity: O(n*log(n))Auxiliary Space: O(n) Comment More infoAdvertise with us Next Article Merge Sort for Linked Lists in JavaScript G GeetanshuGulati1 Follow Improve Article Tags : Linked List Sorting Recursion JavaScript Web Technologies DSA +2 More Practice Tags : Linked ListRecursionSorting Similar Reads JavaScript Linked List Programs JavaScript Linked List Programs contain a list of articles based on programming. Linked List is a linear data structure that stores data in linearly connected nodes. Linked lists store elements sequentially, but doesnât store the elements contiguously like an array. S. NoArticles1JavaScript Program 5 min read Implementation of LinkedList in Javascript In this article, we will be implementing the LinkedList data structure in Javascript.A linked list is a linear data structure where elements are stored in nodes, each containing a value and a reference (or pointer) to the next node. It allows for efficient insertion and deletion operations.Each node 5 min read Javascript Program For Searching An Element In A Linked List Write a function that searches a given key 'x' in a given singly linked list. The function should return true if x is present in linked list and false otherwise.bool search(Node *head, int x) For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then functio 3 min read Javascript Program For Inserting A Node In A Linked List We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.All programs discussed in this post consider the following representations of the linked list. JavaScript// Linked List Class // Head of list let head; // Node 7 min read Javascript Program For Inserting Node In The Middle Of The Linked List Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node.Examples: Input : list: 1->2->4->5 x = 3Output : 1->2->3- 4 min read Javascript Program For Writing A Function To Delete A Linked List A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. This article focuses on writing a function to delete a linked list.Implementation: JavaScript// Javascript program to delete // a li 1 min read Javascript Program For Deleting A Linked List Node At A Given Position Given a singly linked list and a position, delete a linked list node at the given position.Example: Input: position = 1, Linked List = 8->2->3->1->7Output: Linked List = 8->3->1->7Input: position = 0, Linked List = 8->2->3->1->7Output: Linked List = 2->3->1- 3 min read Javascript Program For Finding Length Of A Linked List Write a function to count the number of nodes in a given singly linked list.For example, the function should return 5 for linked list 1->3->1->2->1.Iterative Solution: 1) Initialize count as 0 2) Initialize a node pointer, current = head.3) Do following while current is not NULL a) curre 3 min read Javascript Program For Rotating A Linked List Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer. For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list should be modified to 50->60->10->20->30->40. Assume that k is smal 5 min read Javascript Program For Making Middle Node Head In A Linked List Given a singly linked list, find middle of the linked list and set middle node of the linked list at beginning of the linked list. Examples:Input: 1 2 3 4 5 Output: 3 1 2 4 5Input: 1 2 3 4 5 6Output: 4 1 2 3 5 6 The idea is to first find middle of a linked list using two pointers, first one moves on 3 min read Like