Skip to content
Hallway
0:00 / 0:00

#insertionsort#mergesort#divideandconquer

Lecture 3: Insertion Sort, Merge Sort

MIT OpenCourseWare

6.5M subscribers • 37 videos on Hallway • University channel

YouTube
  • Recommended by 3 people: 2 in engineering communities and 1 curated list.
  • A classic. People kept recommending it from 2015 to 2021.
  • Presented by Srini Devadas, MIT

Intermediate. Assumes working knowledge.

889K views13 years ago3 recommendations

Computer scienceAlgorithmsData structures

Srini Devadas explains insertion sort, merge sort, and divide-and-conquer recurrences in this MIT lecture.

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Srini Devadas License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

Why it's here

3 people recommend this

What people say. Recommended as a highly clear explanation of merge sort and insertion sort.

Moments people linked to

Coding Interview Universitycurated list on GitHubRecommends

Under “Sorting”

Insertion Sort, Merge Sort (video)
View the list

u/HorsesFlyIntoBoxesin r/compsci • Recommends

On “trying to understand mergesort”

Watch the MIT lecture on mergesort. It’s really well explained what’s going on.
3View on Reddit

u/JustGozuin r/compsci • Recommends

On “Learning algorithms through pseudocode vs a specific language (Which algorithm book to buy?)”

Maybe this could help you https://github.com/vhf/free-programming-books/blob/master/free-programming-books.md (I guess you have a kindle or something like that) Edit: I saw your question about merge-sort. Maybe this can help you link to this video
1View on Reddit