Question: What is the time complexity of the following algorithm? def count_zeros(A): count = 0 i=0 while A[i] == 0: count+=1 i+=1 return count sample input
What is the time complexity of the following algorithm?
def count_zeros(A): count = 0 i=0
while A[i] == 0: count+=1 i+=1 return count
sample input : [0,0,0,0,1,5,3]
sample output : 4
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
