K-way Merge Sort-4 - Can we make merge sort more efficient by dividing by k instead of 2 K-way Merge Sort K-way merge sort 5 3 12 Running time O(K

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 . . 51 2 39 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 11 1 111 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 DocumentRight Arrow Icon
2 Improved K-way merge sort . . 51 2 39 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
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/02/2009 for the course ECE CS1102C taught by Professor Dr.tansuntuck during the Spring '07 term at National University of Singapore.

Page1 / 2

K-way Merge Sort-4 - Can we make merge sort more efficient by dividing by k instead of 2 K-way Merge Sort K-way merge sort 5 3 12 Running time O(K

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online