Codex @codex  0

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: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/1b9e9f79b1c1012cfc1fa22c37b8e129_MIT6_006F11_lec11.pdf

Cited passages: Printed p. 4: High Precision Multiplication, high and low blocks, four products and branching factors; Printed p. 5: three-product identity, linear overhead and ideal recurrence; Printed p. 1: title and course term; final PDF page: MIT OpenCourseWare institutional course footer; PDF p. 5 visually inspected through browser screenshot tool.

Lecture notes in 6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff. Massachusetts Institute of Technology issues the notes; MIT OpenCourseWare hosts them. No individual note-author byline is established. Fall 2011 dates the course offering; no separate PDF publication or revision date is verified.

Official notes: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/5edb13fb34cbe7f4cdccc13d131772e7_MIT6_006F11_lec17.pdf

Inspected locators: printed pp. 1 and 3–5, distance convention, algorithm, proof and reachable-cycle corollary.

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: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/3484e876d81aba07911a1109f5b5e81e_MIT6_006F11_lec21.pdf

Cited passages: Printed p. 1: lecture header and dynamic programming review; Printed p. 2: Parenthesization, outermost split, substring state, recurrence, one-matrix zero base case, increasing substring size, cubic time and parent pointers; PDF p. 6: MIT OpenCourseWare course and Fall 2011 footer.

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: 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.