Answer:
The answer is "bubble sort".
Explanation:
Bubble sort is an algorithm that is used for sorting numbers. This algorithm provides a comparative method that compares each couple of identical elements and swaps elements if they're not in order.
- It will not work for big data sources.
- Its avg complexity and the worst case is O(n2) not work for big data. In O(n2), n is related to the number of objects.
What are the choices?
Message Boarding is the asynchronous electronic that is know as a forum.
It lets them reach out to people on that platform that can advertise their products
Answer: Suboptimization is referred to as a term that has been approved for common policy mistake. It usually refers to the practice of concentrating on a single component of a whole and thus making changes which are intended towards improving that component and also ignoring its effects on other components.
Answer:
1)
n = int(input("Please enter the length of the sequence: "))
print("Please enter your sequence")
product = 1
for i in range(n):
val = int(input())
product *= val
print("The geometric mean is: %.4f"%pow(product,1/n))
2)
print("Please enter a non-empty sequence of positive integers, each one is in a separate line. End your sequence by typing done:")
product = 1
val = input()
n = 0
while(val!="done"):
product *= int(val)
n += 1
val = input()
print("The geometric mean is: %.4f"%pow(product,1/n))
Explanation:
