8. Permutations

Placeholder only for a chapter. Not yet written.

1
2
3
4
5
6
7
 void f(int x)
 {  int [] as = [1,2,3,4,5];
    int sum = 0;
    for (int i = 0; i < 5; i++) {
        sum += as[i];
    }
 }
1
2
3
4
5
6
7
 void f(int x)   // sourcecode, nostart
 {  int [] as = [1,2,3,4,5];
    int sum = 0;
    for (int i = 0; i < 5; i++) {
        sum += as[i];
    }
 }
1
2
3
4
5
6
7
 void f(int x)   // code-block, nostart
 {  int [] as = [1,2,3,4,5];
    int sum = 0;
    for (int i = 0; i < 5; i++) {
        sum += as[i];
    }
 }

8.1. Glossary

delimiter
A sequence of one or more characters used to specify the boundary between separate parts of text.

8.2. Exercises

  1. Write a program that reads a file and writes out a new file with the lines in reversed order (i.e. the first line in the old file becomes the last one in the new file.)