fix: fix typos

unrenamed · Feb 14, 2025 · f466fe7 · f466fe7
1 parent bce948b
commit f466fe7
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/maze/algorithms/growing_tree.rs b/src/maze/algorithms/growing_tree.rs
@@ -10,7 +10,7 @@ use rand::prelude::*;
 /// to imitate other algorithms or theirs combinations
 #[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, ValueEnum)]
 pub enum Method {
-    /// Selects the most recently added cell, thus imitating the recurive backtracker
+    /// Selects the most recently added cell, thus imitating the recursive backtracker
     Newest,
 
     /// Selects the oldest added cell, thus generating an unchallenging maze with lots of long

diff --git a/tests/help.rs b/tests/help.rs
@@ -82,7 +82,7 @@ Options:
           [default: newest]
 
           Possible values:
-          - newest:            Selects the most recently added cell, thus imitating the recurive backtracker
+          - newest:            Selects the most recently added cell, thus imitating the recursive backtracker
           - oldest:            Selects the oldest added cell, thus generating an unchallenging maze with lots of long corridors
           - random:            Selects cells at random, thus getting Prim's algorithm behaviour
           - middle:            Selects a middle cell from the list of already added, but produces mazes similar to the ones created by the [Oldest](Method::Oldest) method