Question

PYTHON I need help with this Python problem, please follow all the rules! Please help! THANK YOU!

Bonus Question Implement an efficient algorithm (Python code) for finding the 11th largest element in a list of size n. Assume that n will be greater than 11. det find 11th largest numberlissy Given, lissy, a list of n integers, the above function will return the 11th largest integer from lissy You can assume that length of lissy will be greater than 11. For example, - lissy 19,8,6,4,22,68,96,212,52,12,6,8,99,1281 output = find_11th largest number(1155) print(output) Important: . You should not modify the original list, lissy. .Runtime complexity of your implementation should be O(n) You are allowed to use only O(l) additional memory. . You can assume input list size, that is, len(lissy) is always greater than 11 def find_11th_largest number(lissy): : Input type lissy: list of Integers : Return type: Integer, the lith largest integer fron lissy #your code Please upload your solution (a.py file having python code here. What is the runtime complexity of your solution? Please explain briefly. (Write your answers in the python file as comment). Enter your answer here

Answer 1

Please comment, if you need any corrections.Please give a Thumps up if you like the answer.

Program

def find_11th_largest_number(lissy):   
lissy.sort(reverse = True) #Sort the elements in descending order   
return lissy[10] #Return 11 the element in the sorted list

lissy = [9,8,6,4,22,68,96,212,52,12,6,8,99,128]
output = find_11th_largest_number(lissy)
print ("11 the largest in given array is",output)

Output

11 the largest in given array is 8

Screenshot

def find_11th_largest number(lissy): lissy.sort (reverse = True) #Sort the elements in descending order return lissy[10] #Return 11 the element in the sorted list lissy [9,8,6,4,22,68,96,212,52,12,6,8,99,128] output find_11th_largest number(lissy) print ("11 the largest in given array is", output) =