Scenario: It is time for your company\'s annual emergency fire practice drill. W

Question

Scenario:
It is time for your company's annual emergency fire practice drill. While exiting your building, your supervisor orders you to incorporate a debugged, working Sort into the hands-on demonstration scheduled the day after tomorrow for an important client. No advanced features are expected. Tomorrow evening you must attend the reception party for the VIP client, hence the work must be completed before the party. Your system experience tells you that there will likely be several hundred data files, most of them are usually random, but a substantial minority is fairly ordered. The data records are small. Your supervisor does not know if this will become a permanent feature or not. You may assume that the system integration can be finished in a couple of hours.

Question: Pick one of the Sort types (QuickSort, BubbleSort, SelectionSort, HeapSort, InsertionSort, MergeSort, BucketSort, CountSort, RadixSort, etc) and comment on how well the sort will solve the above problem.

Explanation / Answer

MergeSort will solve the purpose.The best case, worst case and average case time complexity of mergesort is nlog(n), therefore it is faster than all other sorting algorithms. Since the worst case time complexity is nlog(n), therefore even if the files are sorted this algo will take the same time.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

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