Question

Define a function called get_n_largest(numbers, n) which takes a list of integers and a value n as parameters and returns a NEW list which contains the n largest values in the parameter list. The values in the returned list should be in increasing order. The returned list must always be of length n. If the number of values in the original list is less than n, the value None should be repeated at the end of the returned list to ensure it is the correct length.

Note: the parameter list should remain unchanged.

Define a function called get_n_largest (numbers, n) which takes a list of integers and a value n as parameters and returns a NEW list which contains the n largest values in the parameter list. The values in the returned list should be in increasing order. The returned list must always be of length n. If the number of values in the original list is less than n, the value None should be repeated at the end of the returned list to ensure it is the correct length. Note: the parameter list should remain unchanged. For example: Test Result a_list [3, 6, 2, 8, 1, 9, 4] [4, 6, 8, 9] print(get_n_largest(a_list, 4)) (3, 6, 2, 8, 1, 9, 4] print(a_list) = a_list [3, 6, 2] [2, 3, 6, None] print(get_n_largest(a_list, 4)) (3, 6, 2] print(a_list) print(get_n_largest([], 5)) [None, None, None, None, None]

Answer 1

def get_n_largest(numbers, n):
    result = numbers.copy()
    result.sort(reverse=True)
    if len(result) >= n:
        result = result[:n]
    else:
        result = [None] * (n - len(result)) + result
    result.reverse()
    return result