Question

Write a recursive function bag_to_set that takes a list as a parameter and returns a new list in which the values that were in the old list appear only once in the new list (the order should be preserved). Sample data:

Old list: [4, 5, 3, 4, 5, 2, 2, 4]
New list: [4, 5, 3, 2]

The function signature is:

def bag_to_set(bag):
    """
    -------------------------------------------------------
    Copies elements of a bag to a set.
    Use: new_set = bag_to_set(bag)
    -------------------------------------------------------
    Parameters:
        bag - a list of values (list)
    Returns:
        new_set - containing one each of the elements in bag (list)
    -------------------------------------------------------
    """

Answer 1

Here is the answer..

CODE:

def bag_to_set(bag):
   l=[]
   for i in bag:
       if i not in l:       #check if element not in new list
           l.append(i)       #add element to new list
   return l
print(bag_to_set([4,5,3,4,5,2,2,4]))

OUTPUT:

Using Recursion:

l=[]
def bag_to_set(bag):
   if(len(bag)==0):
       return l
   if(bag[0] not in l):
       l.append(bag[0])
   return bag_to_set(bag[1:])
print(bag_to_set([4,5,3,4,5,2,2,4]))

OUTPUT:

If you have any doubts please COMMENT....

If you understand the answer please give THUMBS UP...