Abstract
Termination of an algorithm is usually obvious. In a few cases, however, it is a challenge to find a correct termination argument. In this note we give an example of such a problem and provide not only an argument for termination but also for the time complexity of the algorithm.
| Original language | English |
|---|---|
| Title of host publication | Simplex Sigillum Veri : een liber amicorum voor prof.dr. F.E.J. Kruseman Aretz |
| Editors | E.H.L. Aarts, H.M.M. Eikelder, ten, C. Hemerik, M. Rem |
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Pages | 303-306 |
| ISBN (Print) | 90-386-0197-2 |
| Publication status | Published - 1995 |