# Euclidean Algorithm/Algorithmic Nature

Jump to navigation
Jump to search

## Algorithm

It can be seen from the definition that the **Euclidean Algorithm** is indeed an algorithm:

- Finiteness: As has been seen, the algorithm always terminates after a finite number of steps.
- Definiteness: Each of the steps is precisely defined.
- The inputs are $a$ and $b$.
- The output is $\gcd \left\{{a, b}\right\}$.
- Effectiveness: Each operation is finite in extent and can be effectively performed.

This needs considerable tedious hard slog to complete it.In particular: Go into detailTo discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Finish}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |