10 Sorting Algorithms Easily Explained

preview_player
Показать описание
Every programmer has run into sorting algorithms at one point in their career. 🧑‍💻 In today's video I am going to explain 10 Sorting Algorithms as easy as possible in only 10 minutes with the pros and cons of each.

Each sorting algorithm is explained in surface level, then the mathematical formula is explained and ending with a real life example. I encourage you to watch this video and whatever one intrigues you the most, go look up some tutorial on how you can implement this in your favourite programming language. 🧑‍💻

👉WE ARE PLANNING A HACKATHON!!! 👈
Join the discord to learn more:

If you like this video, check out some of my other videos where I build awesome projects and provide awesome developer resources that you can use in order to be a better developer :)

LINKS
---
MY NEWSLETTER 💌
------

CONNECT WITH ME ON SOCIAL


My gear 💻
-----

Timestamps
0:00 Intro
0:11 Bubble Sort
1:29 Selection Sort
2:24 Insertion Sort
3:13 Merge Sort
4:29 Quick Sort
5:41 Heap Sort
6:54 Counting Sort
7:48 Shell Sort
8:38 Tim Sort
9:27 Radix Sort
10:27 WATCH!!!
Рекомендации по теме
Комментарии
Автор

Let me know if you guys want me to go more in depth with these types of videos :)

CodingWithLewis
Автор

When we learned about bubblesort in c lessons I really hated how slow it was so I tried to improve it, ending up with mergesort. I know this is nothing but I'll never forget how happy I was reinventing the wheel without reading about it elsewhere to the point this was almost 20 years ago but I clearly remember every detail -code was complete jank-

babrad
Автор

You have such a knack for explaining things clearly. Awesome job!

MyCodingDiary
Автор

my man lewis making gold content. every video and short is a hit man. keep up the awesome work

BriariusTitan
Автор

I made a sorting algorithm in Excel! It's really easy and I call it Neural Sort!

MinutesScienceChannel
Автор

I didn't think I will revise 10 sorting algos in 10 minutes, with this much efficiency. Thank YOU !

aspiredifferent
Автор

This video is not getting enough love! The way you made this entertaining while sharing real information on sorting algorithms is crazy good.

codingwithroby
Автор

I just wanted to say this is one of the best videos I have watched for a topic like this. I wanted to learn something while I ate some food and this was really insightful and informative. Also straight to the point. I also really liked all of the graphics and the way you explained everything quickly and throughly.

saber-seathearn
Автор

Man love the vibe of your videos👌 Feels more and more cinematic

thecodebendermaster
Автор

5:55 "Heap is a tree-based data structure where all levels are filled except the lowest and is filled from the left to right." This is true but what's with the visual going against that definition? the 4 should be the left child node of the 3, shouldn't it? otherwise it's not being filled from the left lol

eechotunes
Автор

I have watched other people like Brocode and others. But you helped me understand them. Thank you so much!

Isaiahken
Автор

We want more of Data structure and algorithms video ❤

vigneshshanmugam
Автор

My favourite sorting algorithm is still Stalin Sort.

Sinthoras
Автор

Quick sort with pivot: median of(first, middle, last element)
Go ahead and try beat it's performance.

smaug
Автор

If you can sort integers, you can sort colors. Black = Blue = 0x0000FF, Green = 0x00FF00, Cyan = 0x00FFFF, etc.

Pacvalham
Автор

I would love if u get more in depth in these, very interesting video!

maxca
Автор

THIS IS SO UNDERRATED! Wish my CS profs explained like that! Love from India

maunilparikh
Автор

This is a really good video as a refresher because of its concise descriptions and neat visualizations, while also being entertaining with witty remarks about the algorithms

mrqk
Автор

How do you turn the stuff from the code into one of those cool things with the noise and so that it shows the sorting

SaltiemcFattee
Автор

9:59 In verbose, radix sort has a big Oh of the product of the number of numbers in the largest number and the sum of the number of numbers and the base of the largest number.

TheWP
welcome to shbcf.ru