Answered

At Westonci.ca, we make it easy to get the answers you need from a community of informed and experienced contributors. Explore a wealth of knowledge from professionals across different disciplines on our comprehensive platform. Join our Q&A platform to connect with experts dedicated to providing accurate answers to your questions in various fields.

Design a Python3 function to compare every prefix of a string X to every element of string Y, if there is a match, place it in a python set, sort and reversely sort the set, and return the sorted and reversely sorted sets.

Sagot :

MrRoyal

Answer:

The function is as follows:

def compare_prefix(strX,strY):    

   prefix=set()

   for i in range(len(strX)):

       for j in range(i+1,len(strX)):

           chk =strX[i:j+1]

           if chk in strY:

               prefix.add(chk)

   

   sort_prefix = sorted(prefix)

   rev_sort_prefix = sorted(prefix,reverse=True)

   return(sort_prefix,rev_sort_prefix)

Explanation:

This defines the function

def compare_prefix(strX,strY):    

This creates an empty set, prefix

   prefix=set()

This iterates through each character in strX

   for i in range(len(strX)):

This iterates through every other character in strX

       for j in range(i+1,len(strX)):

This gets the prefix of strX by concatenating strings from i to j + 1

           chk =strX[i:j+1]

This checks if the prefix is in strY

           if chk in strY:

If yes, the string is added to set prefix

               prefix.add(chk)

   

This sorts prefix

   sort_prefix = sorted(prefix)

This reverses the sorted prefix

   rev_sort_prefix = sorted(prefix,reverse=True)

This returns the sorted and reversed prefix

   return(sort_prefix,rev_sort_prefix)

Thank you for visiting our platform. We hope you found the answers you were looking for. Come back anytime you need more information. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Thank you for choosing Westonci.ca as your information source. We look forward to your next visit.