This is how Paint's bucket fill works (Flood fill algorithm)

Source code: gist.github.com/syphh/8cbad50...
🔴 Learn graph theory algorithms: inscod.com/graphalgo
⚙ Learn dynamic programming: inscod.com/dp_course
💡 Learn to solve popular coding interview problems: inscod.com/50problems_course
⌛ Learn time and space complexity analysis: inscod.com/complexity_course
🔁 Learn recursion: inscod.com/recursion_course
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/linkedin) and Instagram (inscod.com/instagram)

[@insidecode]

Discover the new graph theory algorithms course: inscod.com/graphalgo 🔴 / \ 🔵-🔴 | | 🔴-🔵

[@szilardbenyovszky5075]

Man you deserve more recognition. I went from hopless to implementing flood fill into my command like paint project in 9 minutes. Thanks :)

[@csaki01]

Thank you! This was exactly the 8 minute video I needed to learn about flood fill algorithms for today's job.

[@alexromero3274]

I'm a visual learner and your videos are SO helpful! I appreciate it! Thank you :-)

[@insidecode]

You're welcome!

[@nishaindesilva3738]

yup me too....videos are very self-explanatory compared to long scrolling websites

[@hangkikuta6786]

This is a GOD SEND to me to prepare for my exam. Thank you!

[@pingpong-kv6eq]

Thanks you man that was really well shown

[@anhduc0913]

How did you make videos like this? This is very informative and is great for visualising algorithms while also explaining the coding for it.

[@ThibJoker]

Just what I needed, thank you !

[@tanvirahmed3715]

Wonderful explanation, flood fill was blurred to me until now. Thanks

[@insidecode]

You're welcome!

[@user-jo5cz6gu7s]

It’s so wonderful. Thank your uploading!

[@insidecode]

You're welcome!

[@manpt123]

Sir thank you so much for making the algorithms easy and visuable for us.

[@insidecode]

You're welcome!

[@Samimies]

Thanks a lot! I was wondering why my floodfill wasn't working like it should. It turned out that it was because the logic was DFS no BFS.

[@jenniferfan8155]

Best explanation ever!

[@TABandiTA]

Thanks a lot. We need more non-indian math/coding youtubers.

[@florinmatei8846]

If we would use a sorted stack (function of Manhattan Distance from current pixel to the seed one) we might find it useful for maintaining the "shape factor" of current filled zone which is meant for using less working memory data. Also, there could be some "memory data write protection" for the same purpose. These as some start point for further algo features to be added.

[@florinmatei8846]

If the memory data used for the sorted stack kinda needs circulary overwrite, then we might use , first, some data sampling, probabily the shape factor will work pretty well in this case , either

[@insidecode]

Interesting remarks

[@florinmatei8846]

@@insidecode Thank You very much! You are very kind.

[@nishaindesilva3738]

I thank you a lot, the second recommended method works well in my android app. Compared to other method, this technique has no nested loop and less overload. Bravos !

[@insidecode]

You're welcome!

[@cicik57]

@@insidecode you can improve the algorithm by drawing not by point by point, but entire line - until it hits borders and then go to the next line what is near. Maybe you will make do tutorial about that.

[@AryanK1511]

What an amazing video

[@rahulkaushal2985]

Best explanation of the problem thanks sir for clear my doubts 🤩🤩

[@insidecode]

You're welcome!

[@charlescampista9384]

Very well explained! Thanks!

[@insidecode]

You're welcome!

[@afadeevz]

Space complexity for BFS is O(n + m)

[@francescopiazza4882]

Many thanks, pal !

[@sushismitcher225]

the indentation on your github page is broken. Good helpful tutorial!

[@prashanthpremakumar6637]

this was really great!!!!

[@insidecode]

Thanks!

[@gettykung1185]

Thank you!

[@procode6881]

Wonderful,great explaination man

[@insidecode]

Thanks a lot!

[@SimpleLivingHigherThinking]

Cool way of learning computer graphics I was finding it boring to read from other channels

[@iwormix6844]

Hmm, recently i have implemented this algorithm to find the differences between two pictures, and visualize them, I didn't even know, that it has "Flood fill" name :)

[@leilaborromeo]

your videos are so helpful :)

[@insidecode]

Thanks!

[@GameplayDexter]

Hello, Is there any way someone could send me a copy of this when the code is working with pygame (BFS version), as I have trouble implementing the source code linked under the video.? If yes, thank you!

[@arsenbabaev1022]

Wow, calculating islands or biomes is exactly what I was looking for. It will come out soon? or already did

[@insidecode]

already did!

[@Jana-vv5qx]

Very nice code

[@ayt_daily]

That's awesome. Thank you!! Besides, is the magic wand tool method the same as this? can you explain later?

[@insidecode]

You're welcome! Yes magic wand tool uses flood fill, it keeps expanding until it finds pixels with whom the difference is higher than the tolerance. I'll try to make a video on it

[@ayt_daily]

@@insidecode Yes thank you, i'll wait :D

[@Alien426]

Just what I needed. Thanks. The only gripe I have is with the variable names: @6:00 n, m, i, j are not descriptive at all. I would rename "m" to "iWide", "n" to "iHigh", "i" to "iRow", "j" to "iCol"/"iColumn". I know the variable names are better @7:30, but one will run out of single letter names pretty fast. In my opinion it's better to type a little more and be clearer than to save a few keyboard strokes. I like to use Hungarian notation with a single letter for the type (in Python: bVar for boolean, iVar for integer, fVar for float, lVar for list, tVar for tuple, ...), but I guess it's out of fashion for some reason.

[@insidecode]

I think that n, m, i and j are the standard variable names when dealing with matrices, where n and m are the dimensions (rows and columns respectively) and i and j the coordinates of the actual cell

[@Lycam]

Dont use recursion, instead use a Stack or a Queue with a loop. With recursion you let the program use its own stack and it has a small limit.

[@rutabega306]

Not that small tbh. Recursion is fine for reasonably sized canvas

[@samarthtandale9121]

Made the 200'th like 😁

[@definite_d]

1000th like. Great video.

[@prernagolani9014]

very nice video

[@SoraFromIndia]

Hey, yes you have improved a lot from before. Now I can pinpoint the only issue you have cuz you are overall so much more clear in your speech now. It's the way you pronounce words with the alphabet 'O'. Okay lemme try, see when we pronounce a word that has an 'O' in it, like the word - 'word' itself => our lower lip only moves (kinda) but when you are speaking this word, you put too much pressure where the alphabet 'O' is. (Try not to change your intonation too much and maybe just here and there but just a little so that it doesn't sound robotic. I had issues in speaking in monotone and had to learn it the hard way lol) This is just an example for this word. It's not a rule that every word with an 'O' will only use the lower lip. But it makes it a lot clear when we don't put too much pressure in any specific alphabet. Different languages pronounce the English language in a different way due to which we have so many accents. But a common thing in all the accents that are easy to understand => they don't apply pressure to specific alphabets. Once again, just trying to help if all this explanation makes sense. Your knowledge and way of teaching is excellent. All the best mate! Edit - Oh and this one was the best video by far. I had doubts in this one too but it's all clear now. Thanks!

[@insidecode]

Thanks for this detailed feedback! Sure it's gonna help me improve

[@rahulsingh-cn7dv]

Thankyou so much..... !

[@insidecode]

You're welcome!

[@gamermoneyfree8193]

I'm getting recursive limits exceed in python while implementing

[@insidecode]

How much is the size of your grid?

[@gamermoneyfree8193]

@@insidecode my circle radius is 50 but for smaller radius circle it works Is there any way to run it on large radius size without getting error

[@insidecode]

@@gamermoneyfree8193 you can modify the recursion limit with sys.setrecursionlimit, or you can use BFS instead of DFS to avoid recursion

[@gamermoneyfree8193]

@@insidecode ty for response

[@insidecode]

@@gamermoneyfree8193 you're welcomee

[@adamekhobba2156]

🟥🟩