what is the smallest possible depth of a leaf in a decision tree for a comparison sort??

by

Lower Bounds for Comparison Based Sorting: Decision Trees

What is the smallest possible depth of a leaf in a decision tree for a sorting algorithm? answer: The shortest possible depth is n − 1.

Why Comparison Based Sorting Algorithms Are Ω(n*lg(n))

Leave a Comment

Share via
Facebook
Twitter
LinkedIn
Mix
Email
Print
Copy Link
Powered by Social Snap
Copy link
CopyCopied
Powered by Social Snap