write the algorthm which is step by step not the code

Write an algorithm that takes a list of binary numbers as an input, counts the number of 1 's in the Ist, and returns the count as output. example: when the input is [0,0,1,1,0,1,0, 1) the ourput should be 4 (since there are 41 's in the inpot list)