In Lecture 3, Gusfield gives the worst-case analysis of MergeSort by setting up a recurrence relation and solving it by unwrapping.
09/29/10 • 49 min
Generate a badge
Get a badge for your website that links back to this episode
Select type & size
<a href="https://goodpods.com/podcasts/algorithm-design-and-analysis-1002/time-analysis-of-mergesort-85052"> <img src="https://storage.googleapis.com/goodpods-images-bucket/badges/generic-badge-1.svg" alt="listen to time analysis of mergesort on goodpods" style="width: 225px" /> </a>
Copy