Answer:
l = []
while True:
no = int(input())
if no>0:
l.append(no)
else:
break
print(1)
If this helped consider marking this answer as brainliest. Have a good day.
Answer: Eating chicken. drinking cool aid, and playing basketball
Explanation: look at my skin color and u will understand
Answer:
Following are the solution to this question:
Explanation:
This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.
It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.
Please find the attachment file of the sorting.
We are in the modern era and the information era