A naukri.com initiative
Prodevelopertutorial
2w
176
Given an unsorted linked list, sort the list using merge sort.
- To sort an unsorted linked list using merge sort, we divide the list into smaller parts and then merge them in sorted order.
- Merge sort is a divide and conquer algorithm.
- We can apply merge sort recursively on the linked list to divide it into smaller parts and then merge those parts in sorted order.
- The time complexity of merge sort on linked list is O(n log n).
Read Full Article
10 Likes
For uninterrupted reading, download the app