Rot-13

[wiggitywam23]

Start by writing a class to encode text using Rot-13. The class you write must be named RotDecryptor.

Decompose the problem by first writing and testing a method to encode a single character. This method must named rotateCharacter and have the following signature:

public int rotateCharacter( int aCharacter )

This method will take a single parameter that is the integer code for one character (which may or may not be a letter). It then returns the integer code for the "encrypted Rot-13 version" of that character.

So far I've done this, which successfully rotates is, however, I was wondering if there was an easier way to write it, maybe using a for loop.

public int rotateCharacter( int aCharacter )
{
if((aCharacter >= 65) && (aCharacter <= 78))
{
aCharacter += 13;
}
else if((aCharacter >= 79) && (aCharacter <=90))
{
aCharacter -= 13;
}

if((aCharacter >= 97) && (aCharacter <= 110))
{
aCharacter += 13;
}
else if((aCharacter >= 111) && (aCharacter <=122))
{
aCharacter -= 13;
}

System.out.println((char)aCharacter);

return aCharacter;
}

[xcallmejudasx]

What's your question? Nobody here will write your homework for you. Start by posting some work you've done and any errors you're receiving and we can give advice and show you how to fix said errors.

[Fubarable]

Agree. As written your question is nothing but a classic "homework dump". Let's see some evidence of some effort on your part.

[xcallmejudasx]

You could use an array that stores a-z, or you can pretty much just do what you're doing now. Both ways though require that you return to the starting position is the character is within 13 spots from the end.

[wiggitywam23]

cant I just change the if statements, to ...

if((aCharacter >= 65) && (aCharacter < 78))

else if((aCharacter >= 78) && (aCharacter <91))

if((aCharacter >= 97) && (aCharacter < 110))

else if((aCharacter >= 110) && (aCharacter < 123))


it seems to be working.

[xcallmejudasx]

if it's working then sure why not lol