Question

Homework 5: Lists

Please show code in Pycharm

The task is to create the following three functions to demonstrate techniques for working with lists:

1. greatestPair(x), which accepts a list of numbers x and returns the index position of the greatest adjacent pair. For example, if the list [4, 3, 8, 0] was passed to your function, it would return 1, as that the values 3 and 8 form the greatest adjacent pair in the list. Your function should return None if passed an empty list.
2. isSorted(x) that takes a list of numbers and returns True if the list is sorted (either smallest-first or largest-first) and False otherwise. Your function should return None if passed an empty list.
3. intersection(x,y) that takes two lists x and y as parameters and returns a new list containing the intersection of the two parameters (all elements that are common to both x and y). The returned list should not contain duplicate values.

Answer 1

1.def greatestPair(x):
    if len(x)==0:
        return None
    elif len(x)==1:
        return 0
    (a,b) = (x[0],x[1])
    sol = 0
    for i in range(len(x)-1):
        if max(a,b)>max(x[i],x[i+1]) and min(a,b)>min(x[i],x[i+1]):
            (a,b) = (x[i],x[i+1])
            sol = i
    return i
      
2. def isSorted(x):
    if(x==sorted(x) or x==sorted(x,reverse=True)):
        return True
    else:
        return False
  
3. def intersection(x,y):
    lis = []
    for i in x:
        if i in y and i not in lis:
            lis.append(i)
    return lis