Using the Master Theorem with merge sort.

311 Views Asked by At

Using the Master theorem, show that merge sort on n objects takes (exactly)(nlogn) comparisons of objects? Also why is it important to use ceiling function?

I think I know to use case 2, but I'm unsure as to how.