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
-
14076 Solvers
-
Sum the elements in either diagonal of a square matrix
221 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
867 Solvers
-
Returning a "greater than" vector
276 Solvers
-
Matlab Basics - Convert a row vector to a column vector
677 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!