Merge K Sorted Array

In this article, we have explored 3 approaches to merge K sorted arrays such that the resulting array is sorted as well. This involve the concept of Min / Max Heap.

Table of contents:

Problem StatementApproach 1 : Naive ApproachApproach 2: Using mergingApproach 3: Using Min-Heap

Pre-requisite: Min/ Max Heap

Problem Statement

Given K no. of sorted arrays of size N each, merge and sort them, print the sorted output.

ExampleInput:

3 4
1 4 7 10
2 5 8 11
3 6 9 12

Output:

1 2 3 4 5 6 7 8 9 ...