You have found empirically that the methods A of complexity O(n!.5) and B of complexity O(n...

  

Transcribed Image Text:

You have found empirically that the methods A of complexity O(n!.5) and B of complexity O(n log n) process a list of 100 records for TA(100) = 1 and TB(100) = 10 microseconds, respectively. Find their processing times, TA(n) and TB(n), for n records and decide which of them will process faster a list of 100, 000 records. You have found empirically that the methods A of complexity O(n!.5) and B of complexity O(n log n) process a list of 100 records for TA(100) = 1 and TB(100) = 10 microseconds, respectively. Find their processing times, TA(n) and TB(n), for n records and decide which of them will process faster a list of 100, 000 records.

Answer rating: 100% (QA)

Olmos Methods A of complexity o Methods B of complexi... View the full answer