10 weird algorithms every developer should know

this are my people

a subshell is not a new thread its whole new process.

0:59 "the universe wrote this algorithm to cut down on its AWS Bill" 😂😂this got me laughing so hard

Sleep sort is one of the most psychopathic pieces of code you can commit, some people have no morals

You are brilliant mate. Really, how can i learn so much while laughing so much, at each video

I watch this video while screaming

Watched this whole video and understood practically nothing

My favorite is by far *Miracle Sort*. The algorithm just periodically checks if the array sorted in the hopes that it just magically sorts itself.
Believe it or not, but this algorithm actually works, because stray alpha particles can flip bits in memory. These are normally corrected for, but not if enough bits flip at the same time.
The chance is low, but not zero. Whether an array actually gets sorted before the heat-death of the universe is a question I'll answer another time :)

I have no idea what your problem is with Java.

Coherent syntax, reasonable memory safety, objects.

2:31 LMAO 🤣🤣🤣

I prefer Stalin sort. Every item that is not in order gets shot (deleted).

0:10 back WHEN? That's when IT happened!!! THE BITE OF 87'th !!!!!!

0:04 bro constantly! Oh... Just me? 😅

is it just me or there are two voices voicing-over in this video.

This hit the spot!

In my university they only taught us Simulated Annealing and Boyer Moore String Search.

You missed the Fast Inverse Square Root function. I can't believe I can't find anyone else in the comments mentioning it. It is legendary. It is responsible for the incredible performance gains of Quake III and a generation of other video games.

When talking about Simulated Annealing and other approximation algorithms it is important to state, that it is not out to find the optimal solution, but tries to approximate it. By definition it is not an optimization algorithm, as it doesn't check all 2^n possible solutions.

lol at the "a man a plan panama" for boyer moore. I have the same textbook.

After watching this video. I feel like an imposter again in programming as a self taught developer.

Nothing weird about it

quantum bogosort is like rick and morty

dont let em get up to 42 ....

the way I heard quantum bogosort was to
1. bogosort
2. if the list is not sorted, destroy the universe

Clickbait lol, many of them are not even that weird but trivial af

Haha funny algorithms haha you think you understand them until you dive deeper and deeper into the math and they don't work as expected or u don't understand nothing again. Maybe I am talking about quantum optimization algorithms who knows.

Al Gore Rhythm hmmmm

You forgot the best sort of all time—StalinSort. You iterate over the array and remove any items that aren’t in order. At the end you have a sorted list.

I once had to implement marching cubes from ground-up for a problem in optical switch design

Can you make this video but actually explain the algorithms cause after you glossed the first one I lost interest

You forgot the goat: STALIN SORT!

You explained the double slit experiment like a moron lol.. its not when you "look" that it changes behavior... lol. It's when you use any instrument to track its path. You physically looking at it doesn't change anything lol. Being able to differentiate or follow its path with a device or instrument does.

had 2 hit da freaky wit da freaky 😜

i see u lite skinn when u caint beat em join dem 💯

Marching Cube and boyer string search deserves it's own video... You could argue rsa too, but numberphile and other channels already covered those prime factorization toitet whatever ma jih

Where is the DFT from the thumbnail 😢

Encountered Boyer Moore in Genomic Computation.....blew my mind...still have to revise it every six months...😅

Your Ai voice gen did waver a bit there in the middle. Not much, but might want to check the simulation.

Finally some one made sort with O(1) sleep sort but with sleep complexity 😂😂

3:37. Hey!! 👀 Thats me (beginner C programmer)