Merge Sort

100+ posts

Similar Topics

DSA

21k+ articles

Arrays

6.4k+ articles

Amazon

1.8k+ articles

Sorting

1.7k+ articles

Linked List

1.1k+ articles

Microsoft

820+ articles

Divide and Conquer

230+ articles

Linked-List-Sorting

50+ articles

Insertion Sort

30+ articles

inversion

30+ articles

Merge K sorted linked lists | Set 1

Last Updated: 30 October 2023

Given K sorted linked lists of size N each, the task is to merge them all maintaining their sorted order.Examples:Input: K = 3, N = 4list1 = 1-3-5-7-NULLlist2 = 2-4-6-8-NU ...read more

Merge two sorted arrays with O(1) extra space

Last Updated: 19 October 2023

We are given two sorted arrays. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first array and the remaining numbers a...read more

Last Updated: 30 March 2023

Following is a typical recursive implementation of Merge Sort[tabby title="C++"][sourcecode language="cpp"]// Recursive C++ program for merge sort #includebits/stdc++.husi ...read more

Sorting

Merge Sort

DSA

Merge k sorted arrays | Set 1

Last Updated: 16 February 2023

Given K sorted arrays of size N each, merge them and print the sorted output.Examples:Input:K = 3, N = 4, arr = { {1, 3, 5, 7},{2, 4, 6, 8},{0, 9, 10, 11}}Output: 0 1 2 3 ...read more

Python Program for Merge Sort

Last Updated: 28 August 2023

Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() func ...read more

Merge Sort

Python Programs

Merge Sort - Data Structure and Algorithms Tutorials

Last Updated: 28 November 2023

Merge sort is defined as a sorting algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back toge...read more

Stable and Unstable Sorting Algorithms

Last Updated: 20 July 2023

Stability is mainly essential when we have key-value pairs with duplicate keys possible (like people's names as keys and their details as values). And we wish to sort thes...read more

Merge Sort for Linked Lists

Last Updated: 02 June 2023

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...read more

Merge two sorted linked lists

Last Updated: 10 July 2023

AuxiliaryGiven two sorted linked lists consisting of N and Mnodes respectively. The task is to merge both of the lists (in place) and return the head of the merged list.Ex...read more

Union and Intersection of two sorted arrays

Last Updated: 09 October 2023

Given two sorted arrays, find their union and intersection.Example:Input: arr1[] = {1, 3, 4, 5, 7} arr2[] = {2, 3, 5, 6}Output: Union : {1, 2, 3, 4, 5, 6, 7} Interse ...read more

Arrays

Merge Sort

DSA

Remove Duplicates from an Unsorted Linked List

Last Updated: 12 September 2023

Given an unsorted Linked List, the task is to remove duplicates from the list.Examples:Input: linked_list = 12 - 11 - 12 - 21 - 41 - 43 - 21Output: 12 - 11 - 21 - 41 - 43E ...read more

Inversion count in Array using Merge Sort

Last Updated: 28 July 2023

Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>