An large automotive store maintains a list of 50000 parts that are either availa

Question

An large automotive store maintains a list of 50000 parts that are either available in the store or ready to be ordered. The list is ordered by item number. Every so often a supplier discontinues some parts or adds some new ones. Once a week the list is updated and typically a few dozen items are added or removed. After the update the list needs to be re-sorted. Which sorting algorithm s should be used if performance (speed) is the primary concern? heap sort selection sort insertion sort merge sort quick sort An large automotive store maintains a list of 50000 parts that are either available in the store or ready to be ordered. The list is ordered by item number. The owner decides that he would also like to have the parts sorted by supplier. Within a single supplier all parts should remain sorted by item number Which sorting algorithm is best suited for this task? merge sort heap sort selection sort quick sort insertion sort

Explanation / Answer

7) option 3.  INSERTION SORT

8) option 1: merge sort (stable as well as nlogn performance)

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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