Answer:
count_p = 0
count_n = 0
total = 0
while True:
number = int(input("Enter an integer, the input ends if it is 0: "))
if number == 0:
break
else:
total += number
if number > 0:
count_p += 1
elif number < 0:
count_n += 1
print("The number of positives is: " + str(count_p))
print("The number of negatives is: " + str(count_n))
print("The total is: " + str(total))
print("The average is: " + str(total / (count_p + count_n)))
Explanation:
Initialize the variables, count_p represens the number of positives, count_n represents the number of negatives, and total represents the total of the numbers
Create a while loop iterates until the user enters 0. If the number is not 0, then add it to the total. If the number is greater than 0, increase count_p by 1. If the number is smaller than 0, increase count_n by 1.
When the loop is done, print the count_p, count_n, total, and average
Answer:
for ( initialization; condition;increment)
{
code goes here;
}
in python:
for i in list/range:
code with proper indentation
By initialization above we mean, like int i=0; etc.
By condition like i<10;
and by increment it means like i++, ++i or i+=1; etc
And in python, i can be an integer value if the range is mentioned, and it can be an item of a list if the list is used. We can also use an array, string and various other data structures in python. like we can have characters in a string and so on.
Explanation:
Please check the answer section.
Answer:
O(n) which is a linear space complexity
Explanation:
Space complexity is the amount of memory space needed for a program code to be executed and return results. Space complexity depends on the input space and the auxiliary space used by the algorithm.
The list or array is an integer array of 'n' items, with the memory size 4*n, which is the memory size of an integer multiplied by the number of items in the list. The listSize, i, and arithmeticSum are all integers, the memory space is 4(3) = 12. The return statement passes the content of the arithmetic variable to another variable of space 4.
The total space complexity of the algorithm is "4n + 16" which is a linear space complexity.
