{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

K-way Merge Sort-4 - Can we make merge sort more efficient...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 K-way Merge Sort Can we make merge sort more efficient by dividing by k instead of 2? . . K-way merge sort . . 5 12 3 9 10 6 16 7 Running time: O(K Nlog k N) . . . . . . N N/K N/K N/K 2 N/K 2 N/K 2 N/K 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ……
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Improved K-way merge sort . . 5 12 3 9 10 6 16 7 Running time: O(N log 2 K log k N) . . . . . . N N/K N/K N/K 2 N/K 2 N/K 2 N/K
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}