[Tutor] Algorithm

Alan Gauld alan.gauld at btinternet.com
Mon Aug 24 03:05:11 CEST 2009


"kreglet" <kreglet at gmail.com> wrote

>  The problem that I am having is writing an algorithm for finding all the
> possible words from a given word. For example: python

This sounds a lot like a homework.
We don't give direct help on homeworks but will try to point you
in the right direction. It helps if you tell/show us what you've tried
and where you are stuck.

How do you think it should work?
Can you think of a systematic approach using pen and paper?
Can you program that?
Does it work? What is wrong?

Hint: start with a small word that you can check for correctness.
Also test for things like double letters,
eg see. - is ese the same as ese? (the e's are swapped, honest!...)


HTH,

-- 
Alan Gauld
Author of the Learn to Program web site
http://www.alan-g.me.uk/ 




More information about the Tutor mailing list