Answer:
B.O(1)
Explanation:
When we are implementing ADT stack using linked chain we can pop an entry from the stack having O(1) time complexity because in linked chain we have the head or top pointer in linked chain only.Popping and pushing in stack happens on only one end that is top.So we have move to move top in linked chain to the next and delete prev node.
Answer:
I don't know what the problem is for Charlie to solve so can you put it in the ch.at so I can answer it from there
Explanation:
Answer:
Explanation:
so why are you doing sign up
Answer:
total = 0
for i in range(5):
score = int(input("Enter a score: "))
total += score
average = total / 5
print("The average is " + str(average))
Explanation:
*The code is in Python.
Initialize the total as 0
Create a for loop that iterates five times. Inside the loop, ask the user to enter a score. Add the score to the total (cumulative sum)
After the loop, calculate the average, divide the total by 5
Print the average