This is just a binary combination  yes for uppercase no for lower case so
2^n where n is the number of characters.  It can be implimented by a simple
counter as long as it stays with in the number
of bits of you integer 16 or 32 or 64 and using the integer as a mask to
deside if upper or lower case
for the character at that position.

ie
0     000000000000000      to be determined
1     000000000000001      to be determineD
2     000000000000010      to be determinEd
3     000000000000011      to be determinED
4     000000000000100      to be determiNed
5     000000000000101      to be determiNeD


"Michael Berkowitz" <[log in to unmask]> wrote in message
news:3e5d1622$7@skycache-news.fidnet.com...
> Tracy Johnson writes
>
>
> Some of you may have done this in school or
> there may be something like this on the web.
>
> Does anyone know of or have a program that
> can print all upper and lowercase permutations
> of a string?
>
> The string is:
>
> "TO BE DETERMINED"
>
> (Without the quotation marks.)
>
> For example:
>
>  TO BE DETERMINED
>  To BE DETERMINED
>  TO bE DETERMINED
>  TO Be DETERMINED
>  TO BE dETERMINED
>  TO BE DeTERMINED
>  TO BE DEtERMINED
>  TO BE DETeRMINED
>  TO BE DETErMINED
>  TO BE DETERmINED
>  TO BE DETERMiNED
>  TO BE DETERMInED
>  TO BE DETERMINeD
>  TO BE DETERMINEd
>  To bE DETERMINED
>  TO be DETERMINED
>  TO Be dETERMINED
>  TO BE deTERMINED
> --------------------------------------------------------
> Most languages have string handling capability to either up-shift or
down-shift a string.  Why not do that and then check for "TO BE DETERMINED"
or "to be determined".
>
> Mike Berkowitz
> Guess? Inc.
>
> * To join/leave the list, search archives, change list settings, *
> * etc., please visit http://raven.utc.edu/archives/hp3000-l.html *
>

* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *