K-way merge algorithm: Difference between revisions

Revision as of 02:27, 4 August 2017

Revision as of 14:26, 10 November 2017

Line 67:

===== Example =====

Let'snow say we have 4 sorted arrays:<blockquote><code>{5, 10, 15, 20}</code></blockquote><blockquote><code>{10, 13, 16, 19}</code></blockquote><blockquote><code>{2, 19, 26, 40}</code> </blockquote><blockquote><code>{18, 22, 23, 24}</code></blockquote>We start with the heads of each array and then build a binary tree from there.

Let's say we have 4 sorted arrays:<blockquote><code>{5, 10, 15, 20}</code></blockquote><blockquote><code>{10, 13, 16, 19}</code></blockquote><blockquote><code>{2, 19, 26, 40}</code> </blockquote><blockquote><code>{18, 22, 23, 24}</code></blockquote>We start with the heads of each array and then build a binary tree from there.

[[File:Binary Ideal Merge 1.png|centre|thumb]]