is thie the algorithm for cheking

[nitin ratra]

step1. mid_index = (total_length - 1)/2 (for odd) or (total_length/2)-1 for even

step2. max_index = total_length - 1 (to pick up letters from end)

step2. loop_index = 0

step3. pick letter at loop_index, pick letter at max_index - loop_index

step4. compare them, if not equal, print "not palindrome" and exit.

step5. loop_index = loop_index + 1

step6. if loop_index > mid_index goto step7 else goto step3

step7. end of loop, and no mismatch found. Hence print "palindrome" and exit.



This is the algorithm for checking if NITIN is a aplindrome or not is it ryt friends

[Amit Ghorpade]

This is the algorithm for checking if NITIN is a aplindrome or not is it ryt friends

Why dont you check it out yourself

And while posting use UseRealWords."ryt" is no a real word.

[Amit Ghorpade]

And do not ask the same question more than once, it wastes useful time of others and also reduces the the number of replies you get.
Read this for more information.
someone among the moderators will close this thread.

[Henry Wong]

Yes, let's continue this in the orignal thread...

https://coderanch.com/t/411445/java/java/check-whether-word-palindrome

I will close this one.

Henry