MIT 6.006 Lecture 3: Insertion Sort, Binary Insertion & Merge Sort Recurrences
Compares Θ(n²) in-place sorting against divide-and-conquer Merge Sort via recursion-tree cost accounting and auxiliary space trade-offs.
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas
More courses at http://ocw.mit.edu
Previous · Lecture 2
MIT 6.006 Lecture 2: Models of Computation, Random Access Machine & Document Distance
Next · Lecture 4MIT 6.006 Lecture 4: Priority Queues, Binary Heaps & O(n) Build-Max-Heap
Discussion
0Join the discussion — share questions, derivations, or timestamped notes.Sign in to comment
No comments on this lecture yet. Start the discussion above.