lec7 - Outline D-way merge a variation of mergesort...

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

View Full Document Right Arrow Icon
Outline D-way merge — a variation of mergesort Lowerbound proof A summary (see additional slides) Applications of sorting ADT: symbol table Lecture 7, Lowerbound and ADT Symbol Table p. 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
Lowerbound: comparison-based model, lower- bound Relative order is determined by a compara- tor We may not inspect the values Decision tree: A decision tree is a full binary tree that rep- resents the comparisons between elements that are performed by a particular sorting algorithm Lecture 7, Lowerbound and ADT Symbol Table p. 2
Background image of page 2
Number of possible outcomes — the num- ber of permutations: n ! The number of leaves in the decision tree — the number of permutations The worst-case running time of an algo- rithm — the longest root-to-leaf path The minimum height of a binary tree with n ! leaves — Θ( n log n ) Conclusion — no comparison-based sort- ing algorithm runs in o ( n log n ) time; Ω( n log n ) time bound for
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

lec7 - Outline D-way merge a variation of mergesort...

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

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