Question: 9. Is it possible that one can sort any 8-element array in 15 comparisons? (a) yes (b) no 10. Which of the following gives the

 9. Is it possible that one can sort any 8-element array

9. Is it possible that one can sort any 8-element array in 15 comparisons? (a) yes (b) no 10. Which of the following gives the number of internal nodes in an n-element heap? (a) (2n) (b) (2n) (c) (2n+1) (d) (2n+1) 11. Which of the following gives the number of leaves in an n-element heap? (a) (2n) (b) (2n) (c) (2n+1) (d) (2n+1) 12. Let be the golden ratio. Which of the following expressions must be an integer for any positive integer n ? (a) 2n+2n1+51(n+n(1)n) (b) 2n+2n1+51(nn(1)n) (c) 2n2n1+51(n+n(1)n) (d) 2n2n1+51(nn(1)n)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!