A termination and time complexity argument

J.T. Udding

    Research output: Chapter in Book/Report/Conference proceedingChapterProfessional


    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 languageEnglish
    Title of host publicationSimplex Sigillum Veri : een liber amicorum voor prof.dr. F.E.J. Kruseman Aretz
    EditorsE.H.L. Aarts, H.M.M. Eikelder, ten, C. Hemerik, M. Rem
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    ISBN (Print)90-386-0197-2
    Publication statusPublished - 1995


    Dive into the research topics of 'A termination and time complexity argument'. Together they form a unique fingerprint.

    Cite this