Lecture 2: Models of Computation, Document Distance

Name: Lecture 2: Models of Computation, Document Distance
Uploaded: 2013-01-14T20:26:48Z
Duration: 48 min 52 s
Description: Description: This lecture describes an algorithm as a computational procedure to solve a problem, covers the random access machine and pointer models of computation, and introduces the document distance problem. Instructor: Erik Demaine

48:52

Up Next

Lecture 3: Insertion Sort, Merge Sort

Continue

Description: This lecture describes an algorithm as a computational procedure to solve a problem, covers the random access machine and pointer models of computation, and introduces the document distance problem.

Instructor: Erik Demaine