Octave Programming Tutorial/Loops and conditions
Loops are used to repeat a block of code for a known or unknown number of times, depending on the type of loop. Using loops, you will draw some nice pictures of fractals and shapes drawn with random dots.
for loop[edit | edit source]
for loops to repeat a block of code for a list of known values. As an example, we'll calculate the mean of a list of values. The mean is calculated from
We set up a vector with some values
octave:1> x = [1.2, 6.3, 7.8, 3.6];
and calculate the mean with
octave:2> sum = 0; octave:3> for entry = x, octave:4> sum = sum + entry; octave:5> end; octave:6> x_mean = sum / length(x)
Line 2: Set sum equal to 0.
Line 3: For each value in x, assign it to entry.
Line 4: Increment sum by entry.
Line 5: Ends the for loop when there are no more members of x.
Line 6: Assign the final value of sum divided by the length of x to x_mean.
TO DO: get a better example and explain the code.
In general, we write a
for loop as
for variable = vector ... end
... represents the block of code that is executed exactly once for each value inside the
Example: The Sierpinski triangle[edit | edit source]
The Sierpinski triangle is a fractal that can be generated with a very simple algorithm.
- Start on a vertex of an equilateral triangle.
- Select a vertex of the triangle at random.
- Move to the point halfway between where you are now and the selected vertex.
- Repeat from step 2.
Plotting the points that you visit by following this procedure, generates the following picture.
The code that generates this fractal is shown bellow. Note that this code uses one very simple for loop to generate the fractal (for i = 1:N ; ... ; end)
axis ([-1, 1, -0.75, 1.25], "square"); figure(1, "visible", "off"); % no plotting window hold on; % defining the vertices of an equilateral triangle (symmetric to y-axis) V = [ 0, 1; % top vertex cos( (pi/2)+(2*pi/3) ), sin( (pi/2)+(2*pi/3) ); % left vertex cos( (pi/2)-(2*pi/3) ), sin( (pi/2)-(2*pi/3) ) % right vertex ]; r = floor(3*rand(1)+0.9999999999); % integer random number in [1:3] x = [ V(r,1), V(r,2) ]; % initializing x on random vertex for i = 1:1000 % !!! 100000 => time=130m57.343s r = floor(3*rand(1)+0.9999999999); % integer random number in [1:3] x = ( x+V(r,[1:2]) )./2; % halfway, current to random vertex plot(x(1),x(2), "."); endfor print -dpng "sierpinski_m.png";
Exercises[edit | edit source]
- Write a script that sums the first N integers. You can check your result with the formula .
- Write a script that does the same thing as the
linspacefunction. It should start at some value,
xstart, stop at
xstopand create a vector that contains N values evenly spaced from
xstop. You can use the
zerosfunction to create a zero-filled vector of the right size. Use
help zerosto find out how the function works.
while loop[edit | edit source]
The while loop also executes a block of code more than once but stops based on a logical condition. For example
x = 1.0; while x < 1000 disp(x); x = x*2; endwhile
x by 2 until its value exceeds 1000. Here,
x < 1000 is the condition of the loop. As long as the condition holds (is true), the loop will continue executing. As soon as it is false, the loop terminates and the first instruction after the loop is executed.
The general form of a while loop is
while condition ... endwhile
Exercise[edit | edit source]
- Write a script that calculates the smallest positive integer, n, such that for some real numbers a and b. (Meaning, find the smallest power of a that is at least b.) Using the
logfunction is considered cheating.
Example: The Mandelbrot fractal[edit | edit source]
The Mandelbrot set is another fractal and is generated by checking how long it takes a complex number to become large. For each complex number, c,
- Start with .
- Find the first i such that .
We record all of these i values and assign a colour to each of them. This is used to generate an image like this one.
You can download the code that generates this fractal from Mandelbrot.m. Note that there is a while loop (inside some for loops) that tests whether the complex number z has modulus less than 2:
while (count < maxcount) & (abs(z) < 2) ... endwhile
The first condition in the while loop checks that we do not perform too many iterations. For some values of c the iteration will go on forever if we let it.
See also another version by Christopher Wellons
do...until statement[edit | edit source]
These loops are very similar to while loops in that they keep executing based on whether a given condition is true or false. There are however some important difference between
whileloops have their conditions at the beginning of the loop;
do...untilloops have theirs at the end.
whileloops repeat as long as the condition is true;
do...untilloops continue as long as theirs is false.
whilewill execute 0 or more times (because the condition is at the beginning);
do...untilloops will execute 1 or more times (since the condition is at the end).
The general form of a
do...until loop is
do ... until condition
Exercise[edit | edit source]
Write a script that calculates the greatest common divisor (GCD) of two positive integers. You can do this using Euclid's algorithm.
Challenge[edit | edit source]
Write a script that generates random number pairs (a, b) that are distributed uniformly
- over the disc (the first image below);
- as in the second image below
continue statements[edit | edit source]
Sometimes it is necessary to stop a loop somewhere in the middle of its execution or to move on to the next value in a for loop without executing the rest of the loop code for the current value. This is where the
continue statements are useful.
The following code demonstrates how the break statement works.
total = 0; while true x = input('Value to add (enter 0 to stop): '); if x == 0 break; endif total = total+x; disp(['Total: ', num2str(total)]); endwhile
break statement, the loop would keep executing forever since the condition of the
while loop is always true. The
break allows you to jump past the end of the loop (to the statement after the endwhile).
break statement can be used in any loop:
The continue statement also jumps from the inside of a loop but returns to the beginning of the loop rather than going to the end. In a
forloop, the next value inside the vector will be assigned to the for variable (if there are any left) and the loop restarted with that value;
whileloop, the condition at the beginning of the loop will be retested and the loop continued if it is still true;
do...untilloop, the condition at the end of the loop will be tested and the loop continued from the beginning if it is still false.
As an example, the following code will fill the lower triangular part of a square matrix with 1s and the rest with 0s.
N = 5; A = zeros(N); % Create an N x N matrix filled with 0s for row = 1:N for column = 1:N if column > row continue; endif A(row, column) = 1; endfor endfor disp(A);
Note that the inner
for skips (continues) over the code that assigns a 1 to an entry of
A whenever the column index is greater than the row index.
if statement[edit | edit source]
The general form of the
if statement is
if condition1 ... elseif condition2 ... else ... endif
condition1 evaluates to true, the statements in the block immediately following the
if are executed. If
condition1 is false, the next condition (
condition2 in the
elseif) is checked and its statements executed if it is true. You can have as many
elseif statements as you like. The final set of statements, after the
else, is executed if all of the conditions evaluate to false. Note that the
else parts of the
if statement are optional.
The following are all valid
% Take the log of the absolute value of x if x > 0 y = log(x); elseif x < 0 y = log(-x); else disp("Cannot take the log of zero."); endif x = input("Enter a value: "); if x > 0 disp("The number is positive"); endif if x < 0 disp("The number is negative"); endif if x == 0 disp("The number is zero"); endif
Example: The fractal fern[edit | edit source]
This algorithm is not quite complete. Have a look at the .m file available from http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=4372&objectType=file.
The image to the right can be generated with the following algorithm:
1. Let x1 and y1 be random values between 0 and 1. 2. Choose one of the linear transformations below to calculate (xi+1, yi+1) from (xi, yi): 1. xi+1 = 0 yi+1 = 0.16yi 2. xi+1 = 0.20xi − 0.26yi yi+1 = 0.23xi + 0.22yi + 1.6 3. xi+1 = −0.15xi + 0.28yi yi+1 = 0.26xi + 0.24yi + 0.44 4. xi+1 = 0.85xi + 0.04yi yi+1 = −0.04xi + 0.85yi + 1.6 The first transformation is chosen if probability 0.01, the second and third with probability 0.07 each and the fourth with probability 0.85. 3. Calculate these values for i up to at least 10,000.
You can download the code that generates this fractal as fracfern.m (this is disabled for now).
Return to the Octave Programming tutorial index