5:12

what about swimdroid's donut

OH, SO THAT'S THE VIDEO ALL ABOUT.

This is another good video on that in c++ from scratch kzbin.info/www/bejne/boizeHRjhsmDr68si=clXJqgjOiFKEqMQm

1 should be prime 1÷1=1 1÷1 (itself) =1

For 2025 please add more sorting algorithms even tho the results will probably very similar

How did you find an image's latents and morph images into one another? Is there an online tool for that or did you do it yourself? Can you publish it on GitHub?

this is a dumb program why not just write a program to see which pillar has the tallest amount of green pixels on the screen and sort them from there in ascending order

Hello, I have a question: How can I make a neural network to detect formulas, characters and mathematical numbers? 😅

Its pronounced DICK STRAW (no its not)

solve them with ms paint bucket tool

Ay man i used you video as a source for my report i hope you don’t mind Im in computer engineering and the report is about (Neuromorphic Computing Using FPGAs)

is this code bullet 2.0?

code bullet clone but he looks like he knows wtf hes talking about

Bro so you know the joe golbarg it's mean that you are heart broken person that's why you are become a programmer 😅😅😅😅😅

Ur character has the same poses as code bullet lol

Me just who just paused the vid at 0:46 and understands it

God I hate turtle so much

Quick question what do you use to make your visualizations what python library do you use to draw the green rectangle specifically

The best sort time is no sort 😭

Could you tell me what python module you use for the graphics?

0:24 ORIGIN SHIFT BY CAPTAIN LUMA

Divide by itself if its anything but one increase and do it again. Make a list of the ones that are positive and discard the negative then once the programs elapsed. Save the list in a file

Cringe ass lil character 😭

as a software engineer, it bugs me a bit that you didn't specify that the ranking of the algorithms are specifically for the amount of values you had, because of the O() notation, that is useful for large values of n and better algorithms like quicksort and merge sort are generally weaker when there's no a lot of data, but dominates for larger amounts, which would explain why comb-sort came before merge sort and quick sort in your test.

Reading and learning about the applications of matrices is one of those eureka moments where things that seemed simple from afar become intricately beautiful up close.

As someone who just started learning Python (transitioning from MATLAB) it was super neat to see the syntax for the different scripts. Thanks!

It was today i realized that 727 is prime.

When will the app be available in google playstore ?

🔥⚡⚡🔥

Сплагиатил у Onigiri, молодец.

Already did

now make a 3d renderer on terminal

I can use sorting algorythms to do my 6th grade math homework yay

Code Bullet? Is that you? ❤

Bubble sort is O(n) for arrays that are close to already being sorted.

Code bullet's voice is weird on this one

The maze program Daedalus has maze that's about 1 billon by 1 billon. Good luck beating that one lel

jsut wanted to know, do you make a lot of money, im asking bcasue you seem to know a lot about coding, so im interested to know how much money someone of your coding experience can make ?

Recommend checking out Eolymp, pretty challenging I’d say

oof, that took long, try godot: Time elapsed: 5.3367604s Primes found: 14630843 Largest prime found: 268435399 and i wasnt using goroutines

Nice

6:19 that is the realty of programing😭😭

So cool, but i would rather NOT try that... maybe later, preferably to understand the formulas more than anything, though i gotta finish with opengl first

It was you

bro can I be a copycat I love your videos lmao 😅

thiiiita

Where did u take free c++ course?

Interesting, but it'd be better if it were done in either C or C++. Still, not bad for a first attempt.

Dijkstra is pronounced dikestra where the i is like eye