Coding Challenge

[@arkamitra4345]

You can use bully sort: Choose the first element. Delete the rest of the elements. Your array is now sorted.

[@mistermixter4123]

Lol

[@yangyang6140]

Arka Mitra Brutal, I like it.

[@ashishthapamagar9166]

You're genius man.😂😂

[@EnteiFire4]

Similarly, there's Stalin sort: Remove all the elements smaller that the last "kept" value. For example : 5, 3, 8, 9, 1, 2, 10 becomes 5, 8, 9, 10.

[@NachoMan154]

Communism sort is: Choose the least element, assign the value to all other elements. The Array is now Sorted. xD

[@kyraaa__]

Thanos sort: delete half and sort the rest! It’s twice as effective

[@sortof3337]

ha ha ha. I am gonna try and implement this.

[@tobiasgorgen7592]

def ThanosSort(list): { while not list.isSorted() { cullHalve(list) } return }

[@dairop3220]

Well i fact sorting isn't linear so it's more than twice effective :)

[@shanewalsch]

And use recursion next, so that the complexity will be O(log n)

[@awsomeguy563]

HOLY CRAP! HE'S FINALLY DOING SORTING ALGORITHMS

[@yesveryprofesionalnameyes6055]

your name is "not really?" so it kindea breakes the point

[@PsychoticBufoon]

I didn’t understand a lick of the computer science, but I was entertained throughout

[@SriNiVi]

As a software developer I just love his thinking approach to an Algorithm. Morover just love to see how happy he is while doing this and how much he's enjoying this.. Big fan.

[@e4r281]

I wish I could bubble sort the stuff in my room.

[@aggbak1]

jordan peterson approves

[@giorgosd3624]

Me too, i can only bubble sort a coca-cola

[@stepan981]

Eh... Kinda slow.

[@nevermind1O844]

pro tip: lock that door, find a new room, forget about the old one... maybe garbage collection kicks in

[@sonicfon]

quick sort for you. Or if you bored, gravity sort it.

[@DigitalNerd]

Dude just did an entire weeks worth of my programming homework in one sitting, added great commentary and instruction the entire time, recorded a fun video and I was still completely more interested in this than doing my own homework. Good shit

[@dielfonelletab8711]

😮 For the first time ever I did something before Dan inspired me to. I feel like a true programmer now!

[@niklasaichinger8281]

m2

[@Triavanicus]

Haha, I did this 2 weeks ago.

[@ravencircles4611]

Did it on a 3ds last year haha these are fun

[@ekarademir]

Daniel, you made me smile! Thanks for all your efforts.

[@Louis_Marcotte]

I've been watching your challenge videos for a while, watching until I understand what it is, actually researching and coding them and then looking at what you did. Pretty fun way to spend/procrastinate through a couple hours

[@rikkiegieler5638]

I suggest: Merge Sort Heap sort Bogo sort and BogoBogo sort ;-) Sleep sort Gravity/Bead sort Comb sort Slow sort Insertion sort

[@giorgosd3624]

Rikkie Gieler Dont forget Miracle sort

[@Triavanicus]

Why not Radix sort as well

[@MasterHigure]

Don't forget Intelligent Design sort.

[@mikeberezhkov7810]

sorting with ML. Why not to try?

[@blasttrash]

And then visualize all of them in a parallel sort way as well. like simulating multiple processors and what not.

[@kostasgeorgiou2417]

📂Documents └📁Videos └📁 The Coding Train └📁 Bad Videos └⚠️ This folder is empty

[@bailey125]

362 likes and 0 comments?

[@JohnDoe-ni9zm]

I'm doing my part!

[@frenzy9741]

Let's fill this section with 500 comments!!! And also subscribe move 5% of Pews subs to the coding train, please, someone!

[@jason_shepherd]

not gonna lie ya had me in the first half

[@hwinangkoso]

I think you should sort out your folders

[@kedarkodgire9506]

My goodness , each video of yours is mesmerizing. I kinda keep watching it till the end even if i don't understand some stuff in between. **most important note is I never get bored of your videos 😅** You're amazing!!!!!

[@glendale87]

Sorting visualizations are so relaxing! Awesome vid :)

[@goldenfreddy8649]

I took a basic computer science class because I needed the credit. We actually used a couple of your videos as references. Now I have a somewhat newfound interest in computer science once again, and these videos are actually pretty intriguing.

[@LillyCode]

I just love your energy, from a 31 year old, 3 year professional coder, going over these basics with that sun in the background and you dancing. Kalabunga what fun learning. Annnd pretty sure I won't have to go over this basic again as you have imprinted it..... so therefore, on to allll your other videos to get that same level of imprint. THANK YOU. I am subscribed and liked and shall continue to like, great great educational, so fun, content. The dances just get me and nervous hahaha been at this for 3.5 hours now, thank you for your time. Super.

[@ElZafro_]

The animation using the noise blew my mind. So cool!

[@Otakutaru]

I LOVE you! Sorting algorithms are too much fun

[@BUZZYBG]

You make coding much more fun!! Keep being yourself!

[@poof65]

This is really a subject that I find interesting. When I was younger I loved to do sort visualizations (and fractals) . You gave me the motivation to continue :) Apart from that, you're very energetic, funny and passionated, keep up the good work

[@anshulmanapure1980]

In which language you used to do visualizations?

[@suzumow]

You are amazing. That was hella fun! Thank you very much.

[@ipoop4359]

YOU’RE THE BEST TEACHERRR PERIODTTTT

[@NachoMan154]

Here is my Version in p5.js: editor.p5js.org/NachoMan/sketches/3dCeFi1_ Im especially proud of the "clean" shuffle algorithm i wrote and don´t really understand by myself but it works great. xD

[@mitalisharma440]

these are so cool. like the energy is contagious and the teachin is so goood. thenkssssssss

[@adibahmed10]

Visual sorting algorithms are like crack for my OCD. I love it!

[@DavidStr98]

the merge sort looks really incredible

[@user-yq8xh]

Your videos are awesome, I have learned so much by watching them! I would love to see a videos series on assembler programming. I did not understand this stuff till now, but I know if you were my teacher I definitely would. :-)

[@ABaumstumpf]

It is nice how the simple lines at 5:25 show the problem with the used "Random" function of java - for most applications it is fine, but the numbers do exhibit a pattern.

[@Cool_Story_Bruh]

Congratulations, you made me want to learn how to code.

[@kayleeemantsal358]

no clue about any of this stuff, but i love your personality so i watch anyway, youre awesome

[@WildAnimalChannel]

I like watching these videos. It's relaxing.

[@mrbrown6421]

Thank you sir, greatly enjoyed. There was a time I wrote code just like that... in machine code, before there was C compiler. More addicting than games, because there were no games...long into the dark and tired night. No source control, no internet. I greatly miss it. 11.27.21

[@nicholas_scott]

Loved this. Takes me back to college. I think every freshman has to make a visual bubble sort so the prof can detail how ineffecient it is

[@DSan96]

Actually it grows polynomially and not exponentially since O(n^2) < O(2^n). For instance, in the case of n=6 as in your example, a polynomial growth implies 36 computations, while an exponential growth 64. Just as a reminder (from biggest to smallest) - Factorial O(n!) - Exponential O(a^n) for a fixed - Polynomial O(n^a) for a fixed - O(n log n) - Linear O(n) - Logarithmic O(log n) - Constant O(a) for a fixed

[@euclid9492]

ehud kotegaro O(n^n) grows even faster than O(n!).

[@spacechicken6316]

@ehud kotegaro not helpful

[@deepakpandey9406]

This guy is crazy but one of the best tutor 😎

[@junaidchoudhary9110]

09:23 that jump though, it feels so relatable..lol

[@frenzy9741]

El julioprofe de la programacion

[@provolke]

You should do a soduko solver! Ive been trying to make one thats a 3x3 for awhile. I wanna try to do it very eligantly.

[@amrsaber5457]

It gets solved fairly efficiently by backtracking, you should try that.

[@alcxander]

@@amrsaber5457 whats backtracking in this context?

[@TheFrankvHoof]

@@alcxander try m.kzbin.info/www/bejne/l6auZIOJj9ScmsU

[@BenMcHone]

@@alcxander Essentially you fill in any number that will currently work in a cell and assume that it's correct. Then you keep filling out the board until you fail, take a step back, try a different number, repeat. You can backtrack all the way to cell #1 if you are unlucky, but this is a slightly more elegant brute force.

[@jeeaile5835]

Awesome video from France !

[@fabu4792]

BON JOOR MISS SURE. COMA SA VA!

[@marowakcity3727]

“Bubble sort is probably the least efficient sorting algorithm” Bogosort has entered the chat

[@yesveryprofesionalnameyes6055]

New sorting algorithm >> DERP SORT Sets a random number to the begining and if it is the smallest keep it and remove it from the list, else get a new random number from the list and keep the old one in the list. Mindblown

[@balla2172]

Man I wish I knew coding/programming has as good as you. I'm trying to teach myself python now. I hope to get to this level some day

[@dfordemo981]

making videos super interesting, cool guy, we really had enjoyed your videos.

[@MarkoFire123]

Queen of sorting!

[@faville]

I don't know what the hell is going on here, but it's cool to see what goes on behind those neat sorting animations that keep popping up in my feed. I never made it past the first couple of Hour of Code levels.

[@10tens5]

I dont even know what's happening but this amazes me!

[@haythamkenway8343]

This guy is a legend.

[@nithinsravan596]

Awesome!!! Man love your channel 🔥😁

[@canaDavid1]

The most (and kind of least) efficient sorting algorithim is the random sort; you randomly arrange the numbers, and check if it's correct.

[@canaDavid1]

And i think it is O(n!)...

[@DevinTyler_2]

YESSSS!!!!! Visualize ALL OF THE SORTS!

[@陈瀚龙]

Insertion, Merge, GO GO GO!

[@Kiotiify]

kzbin.info/www/bejne/iXvadqp3asyCoa8m36s Enjoy this clip from Sorting out Sorting....

and i thought sorting algos would be boring. but with these visualizations?! Damn, Imagination is the limit!

[@beatalert123]

Wow.... I have never ever seen someone using processing other than using it while programming an Arduino :D Took me back to college :D

[@isthisajojoreference7763]

What's this treasure I've stumbled upon

[@undefined6947]

The least efficient sorting algorithm as far as I know is not bubble sort, it's random sort. This randomizes the order of the array, checks if it's in order, if not then it randomizes it again. This method is n! or n factorial, which is much more than n². 7! for example would be 1*2*3*4*5*6*7 which is 5,040, whereas 8! is 40,320. An array of 8 needs an average of 40,320 operations to sort... Crazy. There is basically no reason to do this except fun as far as I know.

[@prakharpandey2392]

Hey Dan I'm almost selected for the National level Coding Championship. 😍😍 All thanks to you and my school teacher😍

[@Khokhar1967]

are you into compettitive programming?

[@alexmcd378]

Should do counting sort. That one got me my job at Microsoft, or helped anyway. Giving them order N when they expected N log N won some points 😅

[@tanyastaneva1500]

Please do the radix sort :)

[@Morpheus396]

Oh how I wish this was available when I did sorting algorithms last year! Great vid. *Ps I'm a proud owner of a copy The Nature Of Code :)

[@addyad_yt]

I don't even know what is processing programming language is but I see his videos for months now to understand the logic then I'm trying recreate it in MATLAB.

[@JimThomson-x3r]

A tip, each subsequent pass only needs to traverse until the last swap, not until the decrementing index. Also, you will know you are at the end if a pass did no swaps.

[@rosslahive]

How did I miss this one? Thanks for the video Dan

[@UnrealOG137]

Stalin sort: Go through the list, and simply delete elements which are out of order. Your array is now sorted.

[@lupinedreamexpress]

3:38 correction not just how long it performs but how many accesses, comparisons, and where the data is access plays a part for one reason: storage media. Rotational drives like algorithms that dont have to move the spindle around the surface constantly or that access data sequentially. Hybrid drives love algorithms that use the beginning of the set as a temporary storage space (solid state occupies the first 10-20% of the drive), NAND and VNAND love algorithms that break themselves up into evenly spaced blocks (blocks of data). Sometimes it's not exactly how long it takes to complete a sort, minimizing damage to your storage media matters at the data center which is how and why many of these sorting algorithms came to be in the computer science world. Hundreds of trillions of disk accesses matter to drive life over time. Big databases enjoy the reliability and benefit of a smartly chosen sorting alogirhtm. FYI the fastest in volatile memory (RAM) for those concerned is pigeonhole. 4000 accesses and 0 comparisons. If you have a mechanical drive that's new, choose Radix (all base forms of RADIX produce sequential, rotational movement during access times when graphed during sorting) , if you've a hybrid drive for your data set, choose WikiSort (first 10% of the set is used as the comparitive area) . Proper choices will preserve the life of your drive.

[@aissagasmi4144]

i lik your explication method it is amazing ...no boring thnx

[@Rankhole123]

Great video as always!

[@xnick_uy]

This was very nice. I was thinking about creating a "genetic algorithm sort" next, combining some of your former videos and this one :P

[@OrangeC7]

Actually, the least efficient sorting algorithm is the random sort. *pushes glasses up nose*

[@Qwentar]

BogoSort. I suspect the Bogo stands for Bogus. Surprisingly it can work for short lists (less than ten elements).

[@NStripleseven]

Nah, miracle sort is worse. "Is it sorted yet? No? Okay, wait, do nothing, wait a minute, and check again.

[@piyushnegi8121]

Again the video i wanted to see..... thank you very much for this video...

[@redhen]

Watching this video features heavily, very heavily, on my to-do list today. Thank you, Dinael Shufflepins. X

[@sudhanshusharma9123]

How do you make everyone laugh even while coding.

[@ravenjs]

Ahhhh and the "jolly-ness" of Dan! It's just so enjoyable to watch your vids! #TheCodingSanta - Santa now codes! *Watching your videos makes me happy! xD

[@jacksonweidmannmann5113]

the most inefficient sorting algorithm is actually the random sort. You rearrange the array randomly and check if it's sorted. I believe the computation time grows at n!

[@comocrearunacarpeta]

Soy de México y estoy estudiando la universidad, curso la carrera en Ciencias de la Computación, conocí tu canal hace no mucho tiempo y me encantó, eres increíblemente ingenioso y muy rápido, con una habilidad tremenda para programar, me la paso viendo tus videos pero mi nivel de inglés aún no es tan bueno como para entender todo lo que dices :(, ojalá que algún día exista un canal en español o yo aprenda bien inglés jaja, en fin quería decirte que incluso a hispanohablantes asombras con tus habilidades de programación. Éxito.

[@tomborninger1752]

David López González tengo classes en espanol.

[@rafaelmorales1926]

Let me translate for you guys: "I'm from mexico, and I'm studying in college computer sciences. I found your channel not so long ago and I loved it, you're really clever and fast, with a tremendous ability to code things. I spend a lot of time watching your videos but my english is still not so good to understand everything you say :(, hopefully someday there is an spanish channel like yours, or I learn english haha. Anyway I wanted to tell you amaze that even to spanish-speakers with your skills."

[@Mumumuth]

面白い。。。

[@T1MK1LL3R4LL]

HEROE!

[@Mikenight120]

Yo tambien estoy estudiando en la universidad Ciencias en computadoras solo que estoy en Puerto Rico metele fuerte al ingles lo vas a necesitar mucho para la programmacion y las oportunidades que vas abrir al entender mejor el ingles con la programmacion

[@neson6624]

Just by watching and understanding what you say I did my HW in a few minutes. I would love to nuke the LIKE BUTTON!!!!! Dude you are AWESOME. Just by watching you makes me smile. :D

[@ageklopstra6153]

More sorting videos please!

[@LillyCode]

you are amazing man, amazing

[@m4rt_]

10:00 you don't need j, you just need i. then just have a boolean saying if everything is sorted, then just end it if that boolean is true (it is sorted) every time you check if it is sorted, if you didn't have to swap then keep it true, but if you had to swap then make it false, and when you reset i to 0 check if sorted is true, if it is true then you didnt have to swap anything and it is all sorted, but if it is false, then set it to true and go over the array again

[@torrin4615]

I spent like 3 hrs in js trying to do the same thing even before I saw this video

[@ravencircles4611]

I did this on a 3ds in 20 minutes these sort algs are fun

[@firephoenix5556]

somehow, there's something so magical about you saying "I just sorted this with a bubble sort"

[@Danacus]

Sorting algorithms! Something I was planning to do! I'm curious to see how the algorithms work.

[@MartynCole]

You can also keep track of whether there is a swap or not. If not you can terminate the sort.

[@CristiNeagu]

That swap function is one of the reasons Python is the best.

[@CristiNeagu]

Why, you ask? Because swapping two values in Python is: a, b = b, a

[@elliotardouin-nesbit5657]

Babe, its 3am, time to watch hours of sorting videos

[@PainDive1]

I loved this one! Gave me ideas on how to study for my CS and algorithms class. I'm glad processing has a library in Python cause I think Python will make it much easier to implement opposed to Java lol.

[@juangoria3517]

You're so fucking crazy xD Love your videos, keep it doing like this

[@vighnesh153]

You can probably use generators using the yield keyword to make the visualization of each step simple.

[@astrotoaster5555]

Please do a video of the quickest sorting method, with this same format please

[@soparado3676]

Great work Dan! Could you try to visualize the Radix Sort?

[@davidbuzatto]

A pretty nice thing to try is to implement some kind of temporal control, so you can go forward or backward in the sorting process. Give it a try 😊

[@AbhishekKumar-mq1tt]

Thank u for this awesome video

[@codeforest9027]

As I goes up... My grammar instincts kick in

[@linx3519]

This dude reminds me of professor from movie where he decode some alien invasion plan. Same level of hype

[@4pxris3]

cool. i like you. you are the type of person i like.

[@mohanish35]

My worst nightmare would be to open KZbin and don't find this channel.

[@roshanpawara8717]

Come on bubble sort you can do it!!

[@Qwentar]

"The Sorting Algorithm That Could"

[@mickyr171]

I really really want to see you do Delaunay triangles Daniel, easy as on paper, not so easy in programming lol

[@NStripleseven]

MickyR What's that?

[@gamingbutnotreally6077]

YAY! Sorting Algorithms!

[@simpletongeek]

I suggest comb sort with 1.2-1.3 factor. It's as fast as quick sort and easier to do than shell sort. I don't know why so many people missed this, but it was mentioned in Byte magazine a long time ago.

[@t_kon]

Nope. In general all sorting has its own pro and cons. But no, quicksort average performance is still better than comb sort.

[@simpletongeek]

Kenneth Anderson I tested it myself. About the only advantage quick sort has over combsort is that using a specialized routine that has reduced element swapping. If you just use a simple routine scan, it is about the same. Again, this is all explained in the article. I'm not convinced comb sort performance is maxed out at this time. There exists still a possibility of seedings that can give even better performance.

[@t_kon]

@@simpletongeek no. Comb sort with a growth ratio of 1.25 or so has an average performance of 3n log n. Which is about 3 times slower than quicksort at just n log n.

[@simpletongeek]

Kenneth Anderson I'm not mathematically advanced to dispute that. But unless it's something you calculated yourself, I'd appreciate a link to the source.

[@t_kon]

@@simpletongeek cs.stackexchange.com/questions/40513/why-is-comb-sort-aka-dobosiewicz-sort-faster-than-cocktail-sort-aka-shake-sor

[@marnix2452]

Love you happy boy 9:22. haha