Lecture 24: Sorting Algorithms

preview_player
Показать описание
MIT 6.100L Introduction to CS and Programming using Python, Fall 2022
Instructor: Ana Bell

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

  1. MIT OpenCourseWare
  2. BOGO sort
  3. asymptotic growth
  4. big oh
  5. big theta
  6. bubble sort
Рекомендации по теме
Lecture 24: Sorting 0:47:39

Lecture 24: Sorting Algorithms

lecture 24 sorting 0:09:34

lecture 24 sorting algorithms

Lecture 24: Convex 0:13:45

Lecture 24: Convex Hull | Sorting Algorithms in Computational Geometry | Sorting for Convex Hull

Counting Sort | 0:38:11

Counting Sort | Algorithms Lecture 24 | The cs Underdog

Quuck Sort Algorithm 0:00:04

Quuck Sort Algorithm in Data Structures #quicksort #sorting #algorithm #datastructures

Lecture 24 Section 0:33:06

Lecture 24 Section 2 -- Selection Sort

Data Structure and 0:09:37

Data Structure and Algorithm - 24 Sorting Assignment

CSE1321 Lecture 24 1:11:47

CSE1321 Lecture 24 Searching and Sorting Algorithms

MSD Radix Sort 0:00:13

MSD Radix Sort (Base 4) in D Major Pentatonic #algorithm #visualization #music #computermusic

Algorithms Lecture 24, 1:16:48

Algorithms Lecture 24, Nov 19, 2019

【Lecture 24 - 0:51:58

【Lecture 24 - Sorting】CS106X, Programming Abstractions in C++, Au 2017

3.4. Sorting and 0:03:33

3.4. Sorting and Searching Algorithms | Computer Science

Merge Sort in 0:00:16

Merge Sort in B Major Pentatonic #algorithm #visualization #music #computermusic

[Level-1 DSA] Lecture-24 0:20:31

[Level-1 DSA] Lecture-24 Selection Sort

2.8.1 QuickSort Algorithm 0:13:43

2.8.1 QuickSort Algorithm

Advanced Sorting Algorithms: 0:10:52

Advanced Sorting Algorithms: Shell Sort

Bubble Sort and 0:22:03

Bubble Sort and Selection Sort Simplified for Beginners | Sorting Algorithms Made Easy | Scaler

Lecture 24 - 0:32:29

Lecture 24 - Chapter 7.4 - Sorting and Searching

Fun with trees 1:12:45

Fun with trees (Fundamental Algorithms, Spring 2022, Lecture 24)

FASTEST sorting algorithm. 0:09:41

FASTEST sorting algorithm. Ever! O(N)

CS50x 2024 - 2:02:12

CS50x 2024 - Lecture 3 - Algorithms

Lecture 24 Section 0:43:16

Lecture 24 Section 1 -- Selection Sort

Gnome Sort in 0:00:29

Gnome Sort in Eb Major Pentatonic #algorithm #visualization #music #computermusic

Lecture 24: Quick 0:24:38

Lecture 24: Quick Sort Explained In One Video | C++ Complete DSA Series

Комментарии
Автор

0:16 Searching a Sorted List
3:27 Why Binary Search?
4:33 Random Sort
7:43 Bubble Sort Intro
11:04 Coding Bubble Sort
14:13 Bubble Sort Complexity
15:28 Selection Sort Intro
19:19 Coding Selection Sort
20:06 Selection Sort Complexity
23:16 Optimized Selection Sort
27:54 Merge Sort Intro
38:48 Coding Merge Sort
45:18 Merge Sort Complexity
46:26 Summary

salahelsaadawy
Автор

Awesome! I like the way professor Ana Bell teach! This lecture is so good!

vinhnguyenucthanh
Автор

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

abhijitrmuley
Автор

The explanation is very clear, thanks a lot! ;)

JoseGonzalez-glbj
Автор

14:18 Good question! before this lecture we use the tuple trick to operate the swap

YinHaotian
Автор

42:30 this makes for a simpler code but why copy and create new lists (added complexity, even though still nlogn), why not just pass down indexes for low and high and operate on the same list, like we did with bisection search?

Efebur
join shbcf.ru