= Lecture 3: Insertion sort, merge sort
{c}
{title2=Fall 2011 course}
Unsigned lecture notes in <6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff>. Issued by the Massachusetts Institute of Technology and hosted by MIT OpenCourseWare. No individual author byline is established. Fall 2011 identifies the course offering; no separate publication or revision date is established.
Lecture notes: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/90a37c49b07b105ea7a027abc67eddc6_MIT6_006F11_lec03.pdf
Cited passages: Slide 18: Meet Merge Sort; slide 31: linear merging; Slides 32–44: balanced recurrence, levels, leaves and equal work per level; Slide 46: quadratic local-work recurrence; Final PDF page: MIT OpenCourseWare, 6.006 Introduction to Algorithms, Fall 2011.
Back to article page
