Question

PYTHON this implementation is really hard, Im stuck especially with the requirements they give. PLEASE HELP! THANK YOU! RECURSIVE!
Give a recursive python implementation of the following function: def check_Decreasing_Order(lissy): Given lissy, a python list of integers, the above function will return True if lissy is sorted in decreasing order, otherwise it will return false. For example, print(check_Decreasing Order([100,50,8, -2])) True print(check_Decreasing_Order([108,50,8,2,35])) False Implementation Requirements: 1. Your implementation must be recursive. 2. If you need more parameters, you may define new functions or helper functions with additional parameters. 3. Runtime complexity of your implementation should be O(n). 4. Don't modify lissy. def check_Decreasing_Order(lissy): ***** : Input type lissy: list of Integers :return type: Boolean, True if lissy is sorted in decreasing order. False otherwise 2 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).

Answer 1

Code and output

for main.py 1- def check_Decreasing order(lissy): 2 k=len(lissy) 3 if k in [0,1]: 4 return True 5 if lissy[@]>=lissy[1]: 6 return check_Decreasing_order (lissy[1:]) 7 return false 8 lissy-list(map(int, input().rstrip().split())) 9 print(check_Decreasing_order (lissy)) 10 11 10 input 100 50 9 8 0 -1 True ...Program finished with exit code o Press ENTER to exit console.

Code for copying

def check_Decreasing_order(lissy):
k=len(lissy)
if k in [0,1]:
return True
if lissy[0]>=lissy[1]:
return check_Decreasing_order(lissy[1:])
return False
lissy=list(map(int,input().rstrip().split()))
print(check_Decreasing_order(lissy))