Read each label then say which of the following it is: Heap Sort Insertion Sort

Question

Read each label then say which of the following it is:

Heap Sort

Insertion Sort

Merge Sort

Quick Sort

Radix Sort

1) "I am a good choice if you want consistent theta(nlogn) time and have lots of space."

*Answer: This is

2) "Although I take O(n^2) time in the worst case, on the average

I only use theta(nlogn) and I do not need as much space as another divide and conquer algorithm.”

*Answer: This is

3) "I use theta(nlogn) time in the worst case. The data structure I use is also useful for efficiently implementing priority queues."

*Answer: This is

4) "Even though my average complexity is theta(n^2), I am a good choice if you want to sort small files, or large files that are very nearly in order."

*Answer: This is

5) "I am a good choice if you want to quickly sort a large number of K digit numeric IDs."

*Answer: This is

Explanation / Answer

1> merge sort

2> quick sort

3> heap sort

4> insertion sort

5> radix sort

feel free to ask if you have any doubt :)

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

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