An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown below.
S
S S S S
S S S S S S S S S
S S S S
S
n = 1 n = 2 n = 3 How many unit squares will there be after the nth iteration?
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers36
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6683 Solvers
-
Generate N equally spaced intervals between -L and L
943 Solvers
-
The Answer to Life, the Universe, and Everything
577 Solvers
-
360 Solvers
-
497 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!