Lecture 24: Sorting Algorithms

MIT 6.100L Introduction to CS and Programming using Python, Fall 2022
Instructor: Ana Bell
View the complete course: ocw.mit.edu/courses/6-100l-in...
UA-cam Playlist: • MIT 6.100L Introductio...
This lecture discusses different kinds of sorting and the levels of complexity of each algorithm. The sorting algorithms discussed are BOGO sort, bubble sort, selection sort, and merge sort.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s UA-cam and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.

[@abhijitrmuley]

Wonderful lecture. Merge sort was explained really well and in a way that is easy to understand and recall.

[@gunawanwibisono5084]

Halo