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
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