The Maximum Length of a Palindrome in a Sequence

  • Jan Tijmen Udding
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

The following development of a program to compute the maximum length of a palindrome in a sequence is a tribute to the structured development of programs of which Edsger W. Dijkstra has been such a strong advocate. It shows that our skills have improved over the years, and that we are able to tackle quite non-trivial problems.

Keywords

Assure 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1990

Authors and Affiliations

  • Jan Tijmen Udding
    • 1
    • 2
  1. 1.Department of Computer ScienceWashington UniversitySt. LouisUSA
  2. 2.Department of Computing ScienceRijksuniversiteit GroningenGroningenThe Netherlands

Personalised recommendations