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 Solvers37
Suggested Problems
-
Back to basics 4 - Search Path
382 Solvers
-
Sort numbers by outside digits
161 Solvers
-
Matrix indexing with two vectors of indices
776 Solvers
-
Fahrenheit to Celsius converter
601 Solvers
-
Find the dimensions of a matrix
561 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!