Palindrome and Anagram Pseudo Code

The assignment content discusses two algorithms: one for detecting palindromes in strings and another for finding anagrams in a given text file. The palindrome detection algorithm checks if the first and last characters of a string are equal, then recursively compares characters from both ends until it finds a mismatch or reaches the middle of the string. The anagram algorithm sorts each string in the text file, uses the sorted string as a key in a dictionary, and stores the original string as its value. It then prints out all the anagrams for each unique sorted string.

Pseudo Code of Palindrome
start -> pointer to traverse string from beginning
end -> pointer to traverse string from end.
function boolPalindrome(string,start,end):
if (length of string < 1)
return True
else:
if string[start] == string[end]:
return boolPalindrome(string,start+1,end-1)
else:
return False
Implementation of Algorithm in Code
1. According to the algorithm first the length of string is checked whether it is less than 1 or
not.
2. After that first and last index of string are compared.
3. If they are similar then continue comparing the indexes until there is only 1 or 0 index left
to compare.
4. If any of the indexes are not similar then string is not a palindrome

Pseudo Code of Anagram
function printAnagrams(txtfile):
dict = {}

for all the string in txtfile:
sorted = sort(string)
key = sorted
value of key = original value of sorted string
if key in dict.keys():
dict[key].append(str)
else:
dict[key] = []
dict[key].append(str)
output = ""
for key,value in dict.items():
output = output + ' '.join(value) + ' '+'\n'
return output
Implementation of Algorithm in Code
Above Algorithm is printing anagrams using List and Dictionary data structures.
1. First sort each string and take sorted value as key and the original value as value of key.
2. If key is already in the dictionary then just append the value in it as the key is already
there.
3. If key is not there then map a empty list to key and append value to it.
4. In the end all key will have list of anagrams