Algorithms - baby step

1. Straight line algorithms: every code is executed, no reuse    (construct: sequence)

2. Branching algorithms: some codes are not executed, no reuse    (construct: selection)

1] conditional statement (if, elif, else)

3. Iterative algorithms (looping algorithms): reuse code    (construct: loop)

1] guess and check algorithms (for, while loop)

->  ways to generate guesses:

1) Exhaustive enumeration
2) Bisection search: faster
3) Newton-Raphson method: even faster

4. Recursive algorithms: call code multiple times (same code within the code, fractal)