Question: George wants to write an algorithm to sort a list of 5 numbers. George can only compare two numbers at a time and decide whether
George wants to write an algorithm to sort a list of 5 numbers. George can only compare two numbers at a time and decide whether or not the first number is bigger than the second, so the decision tree of George's algorithm is a binary tree.
What is the minimum height of George's decision tree of your algorithm?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
