Video

It could always be worse... Miracle sort is a sorting algorithm where you check if the list is already in order, wait to allow time to pray for a miracle, and then check again until it is.

Hello author, I've recently been working on a mathematical physics chronicles content and I very much need to edit 5 seconds of footage using the footage from the video you created, I really, really need the 5 seconds of material. I'll be sure to credit the source of the footage and @ your channel when I'm done with my work. I very much recognize your work and thanks again. : ) (The above text was translated by me, using a translation program, so please forgive me if I use the wrong words)😀

#include <iostream> #include <string> int main() { char machineLetter = 'H'; std::cout << "The great revenge of machine " << machineLetter << std::endl; While(true){} return 0; }

Excellent explanation

This is why I love the internet.

They will never form a square of any size except for the original one, as they clearly can’t form a smaller square and if they could form a bigger one then they would also be able to form a smaller one

amazing videos. how do you make them? which software do you use?

এই বর্ষায়, স্পীডে বাংলা টাইপিং করো খুবই fast "পথমাঠ কিবোর্ড" use করে। ফ্রি পঠমাঠ কিবোর্ড পেতে 🔎 pothmath bangla keyboard লিখে সার্চ করো। 🇧🇩 সার্চের ১ম 4 মিনিটের ▶️ ভিডিওটি দেখো, এরপর কমেন্টে থাকা Drive link 🔗 থেকে নামিয়ে, স্পীডে বাংলা টাইপিং করতে পারবে। প্রফেশনাল ও টুকিটাকি বাংলা টাইপিং এর জন্য এই কিবোর্ড দিয়ে সবচেয়ে দ্রুত শিখতে ও যেকোন জবে টাইপিং করতে পারবে।

Hi, Thank you for making this great effort. Unselfish and straightforward video. ❤

There is a fun way to make bogo worse. Simply save each previously attempted combination and first check if you have already tried that combo, before checking if its ordered. That way you waste even more time and also get rid of the constant space complexity, which is really the only thing bogo has going for it. You can also use a seeded randomizer and simply remember the seed when bogoing to reduce wasted space. However, you do need to use bogo to sort the list of seeds so you can use binary search to check if you've already tried that seed before. Ya know, so its efficient.

When they introduced the observer, the wave functions in my brain collapsed

this is One of two: You are wrong or I am wrong. This tensor need to start with 27 components, not 9 components

If only the internet had existed in 1970...

How to sort your books:

The explain is so brief and clear, thanks so much.

This is wrong! I'm leaving this comment here for people who will be here for 30,40 years when this theory will be disproven. They will look at this and say, good, some people already knew that this was wrong!

There should be a udiprod video of 3Blue1Brown vs udiprod, which one is better at teaching linear algebra.

Finally, two with opponents. Their battle will be legendary!

With all due respect, is this a video that can deny the omnipotence of artificial intelligence?

After gaining a bit of background on Bell's Theorem, this finally clicked for me. Well done!

I think at 15:08 you incorrectly state the XZ plane for B-field, I think you meant YZ

A different explanation: the parity of each coordinate of each spider is invariant. But it is different for the smaller and the larger squares.

It's been almost 11 years and people still don't understand proof by contradiction.

7:30 bogo was so close to being done but then he still took 33 more minutes

the power of stupidity is never understated

"This is a sorting algorithm, it loses. So lets give it alot of extra advantages and see it win"

Man i love gabling with the bro and then we cheat and start communicating using quantum [spin]ics

He did it! He is the [1% of gamblers make it big before quitting]

After watching bogo for so long i was starting to think the joke is the rest of the video was just it sorting randomly I was correct

the funny thing is that's a better-than-average sorting time

Just don't use N and P, duhhhh (please reply to me Chaumas I love you)

H would forever compute the out put ,essentially a soft lock

For shuffling I was always using any old sorting algorithm with clear finish, mostly mergesort, feeding it random comparator function

Bogosort got that drip with the hat

This makes me wonder... what *are* the comparisons? How do those happen?

it’s so over stoogecels

I know bogosort was created as a sort of mathematical joke, but in execution it feels downright psychotic. If algorithms were people bogosort is a serial killer.

Which software are you using for vectors representation

Came here to watch bogo sort succeeding Ended up with the knowledge of how to shuffle things properly

1

Plot twist: H knows how N would act, so it does the opposite of what the answer is

there’s a 1 in 720 chance per trial that bogosort works for 6 balls

This is dumb ah hell it’s like if you smashed x with a hammer and said “well h said it was gonna work so h can’t exist.” Machines exist with the input they’re given they can make estimates, not predict the future. Bro put a cookie in his ps2 and got mad it won’t run.

Это прекрасно ! Спасибо

Humans can't walk on broken legs. Does that prove that it's impossible for humans to exist?

3:41 Why doesn't quick sort just pick the middle one on eachi.e a version of binary search adapted to sorting

just check back later to see if its sorted itself, no need for fancy algorythms

Can you do miracle sort next?

"uhhhh, I think I'll go with... false!" - Wheatley

solution: make the h stuck if the blueprint contains itself