TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Content-Type:
TEXT/PLAIN; charset=US-ASCII
Sender:
"Team Ada: Ada Advocacy Issues (83 & 95)" <[log in to unmask]>
Subject:
From:
Jacob Sparre Andersen <[log in to unmask]>
Date:
Wed, 19 Apr 2000 12:31:02 +0200
In-Reply-To:
MIME-Version:
1.0
Reply-To:
Jacob Sparre Andersen <[log in to unmask]>
Parts/Attachments:
TEXT/PLAIN (15 lines)
Colin Brown:

> question, write an ada program using recursion to find out if the text
> entered is a palindrome. I sort of understand how recursion works, I

Is a palindrome a word where the first and the last letter
is the same, the second and the second to last letter is the
same, and so on?

Greetings,

Jacob
--
"Sleep is just a cheap substitute for coffee"

ATOM RSS1 RSS2