retagged by
282 views

1 Answer

1 votes
1 votes
False. The number of leaves of a decision tree which sorts 5 numbers is 5! and the height of the tree is at least lg(5!). Since 5! = 120, 2^6 = 64, and 2^7 = 128, we have 6 < lg(5!) < 7. Thus at least 7 comparisons are required.

Related questions

1 votes
1 votes
1 answer
3
rsansiya111 asked Feb 25, 2022
277 views
If the average page-fault service time of 20 𝑚s, a 𝑀AT of 80 𝑛s and the probability of a page fault is 10 %. An effective access time will be: 2,000,672 𝑛s2,0...
0 votes
0 votes
2 answers
4
dhruba asked Jun 5, 2023
1,094 views
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). ...