In: Computer Science
Which of the following statements are true for both bubble sort and heapsort?.
a) Largest values accumulate on the right
b) Both must be implemented with arrays
c) Largest values accumulate on the left
d) This is a trick question, there is nothing in common. Heapsort uses heaps, which is a tree.
e) Smallest values accumulate on the left
Hi there, if you need any further help do comment I'll be happy to help you.
for subpart d i didn't understand what really you want please let me know in comment section I'll definitely help you.
Actually i have tried to answer for both in case of increasing and decreasing incase, as you didn;t mention in question.