Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
def isAnagram(s1, s2):
list1=s1
list2=s2
sortedlist1 = sorted(list1)
sortedlist2 = sorted(list2)
if sortedlist1 == sortedlist2:
print(list1+ " and "+list2+ " are anagram")
else:
print(list1+ " and "+list2+ " are not anagram")
Explanation:
Here is a call to the function isAnagram():
list1 =input("Enter String1 ")
list1 =input("Enter String2 ")
isAnagram(list1,list2)
Attached is the run and output for this program
?? it should be radio waves but i guess the next best thing is microwaves