Insert-sort with Romanian folk dance.flv

[@CheeseDog971]

I would like to thank my CompSci professor for making me watch this

[@horacethehippo2445]

Typing this in a comp sci lesson

[@KingOfComedyXD]

Terry Davis was my CompSci professor

[@pressftopayrespects6325]

Mine had my class watch the gypsy folk dance one, haha.

[@XaxtonRevolution2]

This is not insertion sort; this is optimized gnome sort; optimized gnome sort is the same as regular gnome sort except you don’t start over the checking at the beginning each time you do a series of swaps.

[@nilberthsouza]

This is really cool. Blessed be whoever came up with the idea and made it come true

[@rodrigozonzin5835]

how the fuck did I get here?

[@BianCarlo]

I learned in 5 minutes what I was breaking my head to learn in 1 whole day.

[@XaxtonRevolution2]

(Edit: this is Optimized Gnome Sort not Gnome Sort.) I hope you weren't trying to learn Insertion Sort because the video title is misleading; the sorting algorithm in this is actually Optimized Gnome Sort, not Insertion Sort. Still a good video though.

[@XaxtonRevolution2]

actually, this is optimized gnome sort

[@mernus7512]

if you couldn't understand this even just by reading and needed this to fully understand, maybe you should stop trying

[@ЗалинаАхмедова-ы8м]

@@mernus7512 stop being so toxic

[@alexchen6696]

funny, surprised, insightful, respectful

[@GiantSquid13]

I had no idea there were equal number of men and women until the sort was complete. Hilarious, entertaining and beautiful

[@yeeesssssss]

I stopped watching explainers on the algos and just watch the dancing vids at this point

[@selcukozdemir8941]

If that was done in Turkey. Probably Mahmut Tuncer would do that with "Halay".

[@anilokcuoglu]

Halay is our redline

[@SpacepopeSpeaking]

When I have to proof the worth of the human species to some aliens, I'll show them these videos.

[@domzcaj6602]

efectiv genial

[@SpRaT92]

My CS teacher sent me this... I didn't know what the video was about so I didn't get what was happening for the first two minutes, but god, this video is genious

[@XaxtonRevolution2]

I hate to break it to you, but your teacher gave you slightly wrong information because this is not insertion sort, but rather optimized gnome sort. insertion sort is slightly different. i’ll explain later.

[@lesjes4193]

omg ! beatiful !!

[@spider853]

Bravo!

[@mucahidekmekci220]

hey

[@Kayra5138]

I was expecting to write code as homework but this video was not bad either

[@AusticHardOfHearingSinger]

Nice!

[@evarey-kd6ez]

love this, megaovermoc

[@Andreas-zv1se]

Moin Osnabrücker Leute für das Testat 07 :D

[@Natal0ne]

ty

[@BehailuKoricho]

My teacher was not joking..........lol

[@ElifArslan-l9g]

grate

[@johannesbuttgereit886]

grape

[@sergesolkatt]

❤️

[@XaxtonRevolution2]

I would actually like to reinstate my previous point that this is NOT insertion sort but rather a similar sort called, "Optimized Gnome Sort."

[@rpdemo]

Quick question, I could make the algorithm. But wasn't able to make the objects to dance as in the video (just go straight to the point). Does anyone has any lib with allows me to do that?

[@kunju.mp3799]

Nice

[@arismith59]

I was watching Wilbur videos and ended up here.... SOMEONE EXPLAIN ME 💀💀💀

[@akyrvx]

Merci mon prof de nsi

[@adarozer]

Where am I

[@diegojesussilvaeduardo9347]

Where ARE WE?

[@Fmajor7]

Musician here. makes sense. I guess 😅…

[@moonlight-bq6lr]

What is the name of music

[@XaxtonRevolution2]

Isn’t this gnome sort and not insertion sort?

[@RyanLucroy]

Gnomesort and Insertionsort are closely related, but they differ in one step: Insertionsort saves the position of the next element to sort, while Gnomesort goes back up to that position. Since they don't compare the elements again after inserting at the right position, it's Insertionsort.

[@XaxtonRevolution2]

@@RyanLucroy well if you search for insertion sort explained and watch the video with the robots, you will see that insertion sort keeps the current element in an auxiliary array, until all of the necessary swaps of the elements to the left of it are performed. So to go to it in more detail, if this was insertion sort, after the 7 was placed in its correct position, the rest would be different; the 2 would be moved from a[5] to an auxilliary array then compared with the 8 and then the 8 would be moved from a [4] to a[5] but the next step would not be to move the 2 to a[4] but rather to compare the 2 to the variable stored in a[3] which is the 7 and because the 7 is higher, the 7 gets moved from a[3] to a[4] and then the 2 gets compared with the the variabled stored in a[2] which is 3 and because 3 is higher, the 3 gets moved from a[2] to a[3] then the 2 is STILL in the auxiliary array and gets compared with the variable stored in a[1] which is 1 and because 1 is NOT higher than 2, the 2 finally gets moved from the auxiliary array to a[2]. So with insertion sort, NO ELEMENT CAN BE MOVED FROM THE MAIN ARRAY TO AN AUXILIARY ARRAY MORE THAN ONCE.

[@XaxtonRevolution2]

@@RyanLucroy if gnome sort saved the position of the next element to be sorted, it would still be different from insertion sort; it would be optimized gnome sort.

[@NiputuTikaputri]

Saya tidak mengerti

[@lololol338]

polytech nantes idia3 2026

[@gabsor7295]

m smiris

[@Sheiza]

გეპეის დამპროექტებელ ამშენებელი მოვტყან მე

[@giorgigongadze5167]

:დდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდდ

[@alanhasmemes]

Not accurate to romanian folk dancing, if it was truly authentic to romania then the dance would involve stealing someones wallet

[@ultravioletsus]

r/usernamechecksout

[@alanhasmemes]

@@ultravioletsus redditors begone

[@ultravioletsus]

@@alanhasmemes i unironically like your attitude towards people lol

[@dewamaderestia6853]

Nyobrat

[@dewamaderestia6853]

Alit asu

[@absent4440]

Where am i