gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Spelling and spacing fixes (#29783)

Browse Source
This commit is contained in:
Jeremy Nofs
2019-01-14 20:16:35 -05:00
committed by Tom
parent 69a6531bb9
commit 4f79ad82e4
1 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
guide/english/algorithms/boundary-fill/index.md
View File

@ -12,7 +12,7 @@ The most approached implementation of the algorithm is a stack-based recursive f
The problem is pretty simple and usually follows these steps: The problem is pretty simple and usually follows these steps:
1. Take the position of the starting point and the boundary color. 1. Take the position of the starting point and the boundary color.
2. Decide wether you want to go in 4 directions (N, S, W, E) or 8 directions (N, S, W, E, NW, NE, SW, SE). 2. Decide whether you want to go in 4 directions (N, S, W, E) or 8 directions (N, S, W, E, NW, NE, SW, SE).
3. Choose a fill color. 3. Choose a fill color.
4. Travel in those directions. 4. Travel in those directions.
5. If the pixel you land on is not the fill color or the boundary color, replace it with the fill color. 5. If the pixel you land on is not the fill color or the boundary color, replace it with the fill color.
@ -35,5 +35,4 @@ void boundary_fill(int pos_x, int pos_y, int boundary_color, int fill_color)
} }
} }
``` ```
From the given code you can see that for any pixel that you land on, you first check whether it can be changed to the fill_color and then you do so From the given code you can see that for any pixel that you land on, you first check whether it can be changed to the fill_color and then you do so for its neighbours till all the pixels within the boundary have been checked.
for its neighbours till all the pixels within the boundary have been checked.