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
n = 1 n = 2 n = 3
How many unit squares will there be after the nth iteration?
So many choices
"Low : High - Low : High - Turn around " -- Create a subindices vector
Damping of Servomotors with Tachometer Feedback
The Google Interview: Two Eggs Problem
Let's Make A Deal: The Player's Dilemma 2
Expand 10^n to Powers of 4
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office