From f24303d8e7f32b4ad3e6150ed36dc9941e086c9a Mon Sep 17 00:00:00 2001 From: Darryl Yeo Date: Mon, 22 Oct 2018 11:51:46 -0700 Subject: [PATCH] Fix typo: "Excercise" => "Exercise" (#24064) --- guide/english/algorithms/flood-fill/index.md | 9 ++------- 1 file changed, 2 insertions(+), 7 deletions(-) diff --git a/guide/english/algorithms/flood-fill/index.md b/guide/english/algorithms/flood-fill/index.md index 189045653ea..6a57f9cf540 100644 --- a/guide/english/algorithms/flood-fill/index.md +++ b/guide/english/algorithms/flood-fill/index.md @@ -53,7 +53,6 @@ void flood_fill(int pos_x, int pos_y, int target_color, int color) } - ``` As seen above, my starting point is (4,4). After calling the function for the start coordinates **x = 4** and **y = 4**, @@ -63,7 +62,7 @@ and start checking the other adiacent squares. Going south we will get to point (5,4) and the function runs again. -### Excercise problem +### Exercise problem I always considered that solving a (or more) problem/s using a newly learned algorithm is the best way to fully understand the concept. @@ -72,7 +71,7 @@ So here's one: **Statement:** - In a bidimensional array you are given n number of **"islands"**. Try to find the largest area of an island and +In a bidimensional array you are given n number of **"islands"**. Try to find the largest area of an island and the corresponding island number. 0 marks water and any other x between 1 and n marks one square from the surface corresponding to island x. @@ -106,7 +105,3 @@ The problem is quite easy, but here are some hints: 1. Use the flood-fill algorithm whenever you encounter a new island. 2. As opposed to the sample code, you should go through the area of the island and not on the ocean (0 tiles). - - - -