You have a large number of items that need to be sorted and your sorting algorit

Question

You have a large number of items that need to be sorted and your sorting algorithms needs to fulfill the following requirements: it needs to be stable It needs to guarantee a performance of O(N log N) What algorithm should you use? insertion sort selection sort heap sort merge sort quicksort One of the following statements about priority queues is incorrect. Which one is the false statement? Priority queues are FIFO (first in first out) data structures Priority queues remove the element with the highest priority Priority queues can be efficiently implemented with a heap

Explanation / Answer

9) option 4: merge sort

10) option 1: priority queue are FIFO only when priority is same of all elements

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.