Question: 3. (Basic) Explain why the decision tree for any comparison based sorting algorithm must have at least n! leaves. 4. (Basic) Show log2n-(n log n)

3. (Basic) Explain why the decision tree for any comparison based sorting algorithm must have at least n! leaves. 4. (Basic) Show log2n-(n log n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
