Implementing a Flood Fill Algorithm From Scratch

  Рет қаралды 7,707

conaticus

conaticus

Күн бұрын

Пікірлер: 25
@j0of
@j0of 7 ай бұрын
the production quality of this video is INSANE! keep it up 🔥🔥🔥
@conaticus
@conaticus 7 ай бұрын
Thank you! Not my editing
@h4rt360
@h4rt360 7 ай бұрын
Well done, had to rewatch some parts multiple times, but eventually got it!
@Shot_put
@Shot_put 7 ай бұрын
Coool buddy
@CodingWithLewis
@CodingWithLewis 7 ай бұрын
Quality is top notch as always. Can't wait to see more!
@itr-dev
@itr-dev 7 ай бұрын
I think this is kind of a bad example, it makes more sense with disjointed nodes than a grid, since you're essentially writing a slower depth first search. It essentially becomes a path-finding problem where you don't care about the speed of the path itself but the time it takes to find any path. But got some ideas on how it can be sped up even further with the specific requirements above, might try and make a video on it.
@ljreinworth
@ljreinworth 7 ай бұрын
A bit late here, but definitely like this style of explainer video, and props to the editor for the amazing visuals, too! Congrats on 50K, and here's to more awesome content in the year to come!
@conaticus
@conaticus 7 ай бұрын
Thanks so much ♥
@VeryCuul
@VeryCuul 7 ай бұрын
Eyyy new Conaticus upload! Love your vids haha
@dotak9663
@dotak9663 5 ай бұрын
hy you implemented this all by your self ???
@noahdev
@noahdev 7 ай бұрын
This is incredible! The explanation is worthy of praise on its own but with the animations, visuals, SFXs it is beyond amazing. Good job!
@v8metal
@v8metal 7 ай бұрын
awesome video. super interesting !
@rodrigoqteixeira
@rodrigoqteixeira 7 ай бұрын
First: video and edition and clear to understand Secound: wow, i would never be able to think for myself of the top and bottom "virtual nodes" that you added. One simple solution to make it from O(n^2) to O(n) :)
@SteveBClark
@SteveBClark 5 ай бұрын
When a new video is coming vro
@potzko2552
@potzko2552 7 ай бұрын
when you check for the connection you can also assign each node its grandparent, doubles the complexity for the first search but will drastically lower all consequent searches :) great video
@realcontentgamer
@realcontentgamer 7 ай бұрын
This video editing makes it fun to watch and learn.
@Odinoz17
@Odinoz17 7 ай бұрын
Love the new stile Con, keep the great work up!!
@planethac
@planethac 7 ай бұрын
The animations are insane
@virusblitz
@virusblitz 7 ай бұрын
Awesome animations!
@eboatwright_
@eboatwright_ 7 ай бұрын
Flood fill algorithm: Allow me to introduce myself
@conaticus
@conaticus 7 ай бұрын
Thank you! You are genuinely the first person to point out the name of this to me 😂
@eboatwright_
@eboatwright_ 7 ай бұрын
@@conaticus Hahaha yeah, I was so confused like why isn't he just using flood fill... and then I was like ohh... he is using flood fill 😂
@AntonioNoack
@AntonioNoack 7 ай бұрын
Optimization is pretty worthless without benchmarks, unless you can tell the difference clearly. Please include actual benchmarks before you say recursion is slow.
@conaticus
@conaticus 7 ай бұрын
While I didn't do benchmarks, bare in mind this is not my own solution or algorithm. These optimizations have been made by very smart people and have been proven to be very effective for production level applications. Feel free to look into it to find out the performance improvements :)
@WolfDatka
@WolfDatka 7 ай бұрын
Or just make a compute shader for the simpler scenario or even better make the optimised scenario a complete shader
I Solved 100 LeetCode Problems
13:11
Green Code
Рет қаралды 41 М.
WHY IS THE STACK SO FAST?
13:46
Core Dumped
Рет қаралды 156 М.
Как мы играем в игры 😂
00:20
МЯТНАЯ ФАНТА
Рет қаралды 3,2 МЛН
Стойкость Фёдора поразила всех!
00:58
МИНУС БАЛЛ
Рет қаралды 4,6 МЛН
Premature Optimization
12:39
CodeAesthetic
Рет қаралды 812 М.
The BEST Way to Find a Random Point in a Circle | #SoME1 #3b1b
18:35
How I Made a Planet Renderer in Python
5:10
Gpopcorn
Рет қаралды 8 М.
Dear Game Developers, Stop Messing This Up!
22:19
Jonas Tyroller
Рет қаралды 716 М.
Can water solve a maze?
9:09
Steve Mould
Рет қаралды 13 МЛН
What is the Smallest Possible .EXE?
17:04
Inkbox
Рет қаралды 399 М.
I Made a Graph of Wikipedia... This Is What I Found
19:44
adumb
Рет қаралды 2,7 МЛН
The Algorithm Behind Spell Checkers
13:02
b001
Рет қаралды 414 М.
Rust vs C++
7:18
conaticus
Рет қаралды 80 М.
WHY IS THE HEAP SO SLOW?
17:53
Core Dumped
Рет қаралды 227 М.