1- What is the smallest possible depth of a leaf in a decision tree for a comparison...
Fantastic news! We've Found the answer you've been seeking!
Question:
1- What is the smallest possible depth of a leaf in a decision tree for a comparison sort?
2- Prove that is no comparison-based sorting algorithm whose running time is linear for a fraction of 1/(2 n ) of the n! inputs of lenght n.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: