TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

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

Print Reply
Content-Transfer-Encoding:
7bit
Sender:
"Team Ada: Ada Advocacy Issues (83 & 95)" <[log in to unmask]>
Subject:
From:
Date:
Wed, 19 Apr 2000 17:06:00 +0800
Content-Type:
text/plain; charset=us-ascii
MIME-Version:
1.0
Reply-To:
Parts/Attachments:
text/plain (17 lines)
I am a first tear student currently learning ada and am having some
trouble with recursion.
while going through some exercises in the book I am learning from
(programming principles and problem solving in ada.) there is a
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
have been trying for the last two weeks to nut it out but I can't get it
to work.
If anyone can help me with this problem it would be much appreciated.

I know this is not what normally is discussed in this group, But
if anyone can help me with this problem it would be much appreciated.

regards

Colin

ATOM RSS1 RSS2