How to alphabeticize two inputted words when one of the words is capitalized?

[fruit7654321]

What is it you are trying to achieve?
Hey guys. This is my first time at this forum and I'm still a newbie at Turing.
Anyways, the question I'm having trouble with is from my homework at school.

The exact questions is: "5. Write a program that asks for a word and then for a second word. The two words should then be printed in alphabetical order. Be sure to check that your program works correctly. "

If you're reading this, thanks for your time.


What is the problem you are having?
My problem, aforementioned in my title, is that the program works perfectly until the cases of the words are different.


Describe what you have tried to solve this problem
I've tried to fix this problem by first detecting a capitalized letter and changing it, but I don't know how to change it.


Post any relevant code (You may choose to attach the file instead of posting the code if it is too long)
Here's my code:

Turing:

var first, second : string put "Enter the first word: " .. get first put "Enter the second word: " .. get second if (first < second) then     put first, " ", second else     put second, " ", first end if

Please specify what version of Turing you are using
4.1.1

[Zren]

That's because capital letters are different values than their lowercase brethren. Completely different sections of the chart actually:



Basically you want to either deal with just uppercase or lowercase for both strings.

Str.Lower
Str.Upper

[fruit7654321]

Thanks for your reply. I understand it now

Here's my new code, which works:

Turing:

var one, two:string put "What is your first word? ".. get one put "What is your second word? ".. get two if Str.Lower(one)>two then     put two, " ", one elsif Str.Lower(two)>one then     put one, " ", two end if

Now my questions is: Is there a way to do this without using these keywords? And what if there were an undefined number of words to alphabetize? How would i do that?

[Zren]

one = a
two = B

Broken.

As for your second question. You'd first have all the words in an array. Then you'd sort it.

There are tons of ways to sort, but focus on the Bubble sort as it's the easiest to learn (and a good stepping stone).

[fruit7654321]

Okay, so i made it so that both strings would always be lowercase.

Thanks for your help.

[RandomLetters]

Have you considered

one = a
two = a

[fruit7654321]

Wouldn't making it >= and <= fix that?

[RandomLetters]

Yes, but you don't need two if statements.

[fruit7654321]

code:

var one, two:string put "What is your first word? ".. get one put "What is your second word? ".. get two if Str.Lower(one)>Str.Lower(two) then     put two, " ", one else     put one, " ", two end if