I Coded Sorting Algorithms

preview_player
Показать описание
Sub Count: 11,948 Subs
Рекомендации по теме
Комментарии
Автор

I mean… Bogo sort could be the fastest. You’d just have to compare the best times for each algorithm
/j

BobDaTitan
Автор

I like miracle sort, which works by storing the array in a SSD and then waiting for the background radiation to cause enough bit flips to modify the values from the array until the whole array is sorted

officialpottedplant
Автор

I like thanos sort, delete half the data, check if sorted, repeat until sorted

inlinesofcodeorless
Автор

Mom, can we have Code Bullet?
No, we have Code Bullet at home.
Code Bullet at home:

Zomplexx
Автор

There is a universe where Bogo sort is always the fastest except on tuesdays when it's rainy.

phonetheory
Автор

The fastest algorithm is quick sort when talking about a lot of data but if the data is small enough it doesn't matter. That's why algorithms have best and worst case scenarios

xeliotrop
Автор

Stalin sort as long as your data isn't important its great

SiePhi
Автор

bogo sort is O(n) in best case scenario for any input. because, it only has to shuffle and verify.

ThatJay
Автор

for the fastest algorithm if everyone is lazy to see the whole video, it's LSD radix sort

ERRORRubiksZeraBrand
Автор

Man I fell in love with you content I'm subbing

peacegodh
Автор

heap sort is by far ma fav algorithm. it's just so elegent and simple for it's great result. like just a bit of rethinking is required to understand it but then it's easy and it works incredibly well for how easy it is

lucakun
Автор

There is also a reason for having a really fast sort algorithm for upto 3 items.

tschichpich
Автор

Bubble sort is O(n) for arrays that are close to already being sorted.

dennyloevlie
Автор

There is a universe where bogo sort has worked every time

LineOfThy
Автор

i love watching sorting algorithms they make funny sounds

lazlo
Автор

Technically, Bogo sword is the fastest, but you just have to be really lucky

You-nerds
Автор

The most efficient one is when the complexity is constant no matter the size of n

leisexe
Автор

Count sort also has a time complexity of O(n) but also has a space ccomplexity of O(n)

anubisbgmi
Автор

OH, SO THAT'S THE VIDEO ALL ABOUT.

tancurtizaak
Автор

If the numbers are all within a few orders of magnitude, radix sort can be extremely effecient.

nathansavage