Sorting closed

Question

Comments

minimum comparison to sort 5 number is 7 bcz log(n!)  so false

Q is false

---

I think D is correct.

II part reason: Auxiliary sorting in radix sort needs to be stable...so heaps sort can not be used as a Auxiliary sorting because heap sort is unstable sorting algo.

---

yes u r right i forget the stablity factor bcz heap ort is not stable 

---

Auxiliary sorting of heap sort

why not stable?

---

The auxiliary sorting routine in radix sort needs to be stable, meaning that numbers with the same value appear in the output array in the same order as they do appear in the input array. Heapsort is not stable. It does operate in place, meaning that only a constant number of elements of the input array are ever stored outside the array.

---

yes, option D is correct

Answer 1

P is False because of the number of leaves of a decision tree which sort $5$ numbers is $5!$ and the height of a tree is atleast  $log(5!)$. We need atleast $7$ comparisons. 

Q is False because of auxiliary sorting routine in radix sort needs to be stable, meaning that numbers with the same value appear in the output array in the same order as they do appear in the input array. Heapsort is not stable. It does operate in place, meaning that only a constant number of elements of the input array are ever stored outside the array

Comments

can you explain about P statement in solution?how did you get 7.not getting?