Question: 7. Merging 4 sorted files containing 50, 10, 25 and 15 records will take O (100) time. Explain. 8. In worst case Quick Sort
7. Merging 4 sorted files containing 50, 10, 25 and 15 records will take O (100) time. Explain. 8. In worst case Quick Sort has O (n/2) order. Explain. 9. The quick sort algorithm exploit divide and conquer design technique. Describe how it is done.
Step by Step Solution
3.48 Rating (155 Votes )
There are 3 Steps involved in it
A merge sort i faster and its time complexity is Onlogn as from the given question we get that we ha... View full answer
Get step-by-step solutions from verified subject matter experts
