trjhtr

This code could be better?

This is the algorithm:

1. Compare the 1st character to the last character


2. Compare the 2nd character to the second last character and so on


3. Stop when the middle of the string is reached


4. Just words

namespace Palindrome

 class Class1
 
 static void Main(string args)
 
 while (true)
 
 Console.WriteLine("Digit a word:");
 string word = Console.ReadLine();

 if (word == "exit")
 break;

 VerifyPalindrome(word);
 
 

 private static void VerifyPalindrome(string word)
 
 bool compare = true;
 int i = 0;
 while (i < word.Length- 1)
 
 if (compare)
 
 for (int j = word.Length - 1; j >= 0; j--)
 
 if (word[i] == word[j])
 compare = true;
 else
 
 compare = false;
 break;
 
 i++;
 
 
 else
 break;
 

 if (compare)
 Console.WriteLine("This is a Palindrome word");
 else
 Console.WriteLine("This is NOT a Palindrome word");
 
 

As already stated you don't need to set it to true multiple times.

There is cleaner syntax for this.

static bool IsPalidrone(string word)

 for (int i = 0, j = word.Length - 1; i < j; i++, j--)
 
 if (word[i] != word[j])
 
 return false;
 
 
 return true;

One thing I would like to change is the responsibilities of VerifyPalindrome(string word). Remember, your function should only check whether word is a palindrome, nothing else. It shouldn't print out a value, but instead return a boolean that verifies wheter the word is a palindrome or not. Change the function to:

private static bool VerifyPalindrome(string word)

 bool compare = true;

 // ... computing code

 return compare;

And in Main:

if(VerifyPalindrome(word))

 Console.WriteLine("This is a Palindrome word");

else

 Console.WriteLine("This is NOT a Palindrome word");

The other thing I would change is your palindrome logic. Instead of keeping track of a variable compare for whether a string is a palindrome or not and using breaks, which increases the complexity of your code, you can reduce the function to the following, with multiple returns:

private static bool VerifyPalindrome(string word)

 int i = 0;
 while (i < (word.Length / 2) - 1)
 
 for (int j = word.Length - 1; j >= 0; j--)
 
 if (word[i] != word[j])
 return false;
 i++;
 
 
 return true;

No you could further shorten this by combining the two loops into one, but I'll leave that as an exercise to you.