Видео

now make it in scratch

You are comparing algorithms that work for any data (that is, general ones) with those that only work for specific types of data. The first ones only use the "<=" operation on array elements. For the second category, we must assume that, for example, the sorted elements are integers written in the decimal system. Therefore, in this category, the algorithms may be fast, but they do not work for arbitrary data. The QuickSort algorithm belongs to the first class of algorithms, the RadixSort algorithm - to the second.

I do not understand a single thing happening here

Radix sort has comparison part of bubble and bucket sort only 😅

i want to get a maths deep explanation video..pretty pleaaaaaseeeeee... :)

Neural network *from* scratch: ❌ Neural network *with* scratch: ✅

I feel so stupid when i watch your vids

relu is just math.max(0,x), or just a fancy way of saying "if the output of a neuron is <0 just make it 0", or "negative numbers get outta here"

some sorting algorithms are faster in small datasets than in large datasets (shut up i know hybrids exist) its like how O(n) is faster than O(n log n) sometimes or at least i think im the one who supports bubble sorting cuz ez to program

dont add print statements if you want code to run fast learnt that the hard way when making a 3d renderer

I think it is pronounced dyjkstra Not sure tho

its 2024 :) . Get creative

When you ask the network if it's a 7 or not..does it initially have a stored reference parameter set to compare with in order to know if the given photo is of a 7?

its giger bite

Awesome

Some algorithms work quicker in large data, some work faster with less data.

Makes me want to write my own test, but in C. I figure I could either visualize it with colored terminal output, or alternatively use RayLib.

5:41 isn't it supposed to ve Radix sort vs Bucket Sort? You wrote bubble vs Bucket

What did you use to build the visualizer?

"just go right bro" also the maze i have to go though hugging the wall:

where were you when i was getting cooked in DATA STRUCTURES & ALGORITHMS

this is so good!!

Now make a reinforcement learning agent from scratch (or you cant do that)

Get this man a million subscribers

How did you represent the maze in memory? Adjacency matrix or list?

How do you animate the character?

Just discovered this awesome channel. Amazing content, keep up the great work🙌

The background music makes it look like this topic is just really really cool. Or maybe it's just because I have watched gaming videos with such bg music that similar bg music videos make me feel interested in the topic.

7:35 the race of all the races🗿🍷

Your animated character is very corny

Should have told it when I was in 4th grade

u cooked the network

Step 1 dawnload someones video Step 2 change the filters to change the colour Step 3 change the music Step 4 repost

im the one 1500 like 🎉

Buy 196 Gb of ram and Ryzen Epic, and retry

1:29 howd u make that background

I have to say your content is awesome, codebullet is obviously your inspiration, (he’s okay just cusses to much for me) I like your content more. Keep doing good work, and good luck in life.

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

everyone knows that green code and code ballet are the same person

When took lsd😂

are you code bullet?

now implement it using automatic differentiation💀

I will act like i understood literally everything lol

bro consistently shows that he shouldn't have a coding channel at every opportunity with novice level mistakes, then when you call him out on his hyperbolic claims hes "just doing it for fun" 💀

You should add Counting Sort. It only works for positive integers (can easily be modified for negatives) though.

Bro,Thank you for reminding me not to waste any more time,Visualization is more impactful than i thougth!

Actually, many sorting algorithms have complex behaviors, being able to detect when a sub set is getting slow, when that happens the sorting strategy changes

2:46 its just green

Love your content, but i've got a little suggestion: next time if you're doing a comparison of some sort, make the times equal, because in this video you ran some for 5mins, some for 10secs

Is and operation of right wall and left wall algorithm makes path and makes best path?