7. Merging 4 sorted files containing 50, 10, 25 and 15 records will take O (100)...

Transcribed Image Text:

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. 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.

Answer rating: 100% (QA)

Here is your solution hope it helps 7 We have four sorted files of 50 10 25 and 15 records respectiv... View the full answer