I have no idea how to begin for this:
In general, what would be the average running time of the merge sort method for computing the intersection between two lists of n students (assuming n>=32000)? Give your answers as a function of n (e.g. T(n) = 43 n + 5 log(n) milliseconds).
Could someone please help?

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Hm. Do you know what the merge sort method for computing the intersection is?

The only weird thing about this is that merge sort implies there's an ordering to these students.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.