How would you define an algorithm if you had to do it yourself?

Find the Time Complexity =  Find the Space Complexity =

It's possible that a Machine Language explanation might be given in only a few sentences. Also, what variables contribute to machines' lack of English language comprehension?

Suppose an algorithm requires 2n steps to complete a task for an input of size n. If the size of the input is doubled, what happens to the number of steps?     The number of steps for the larger input is equal to the number of steps for the original input.     The number of steps for the larger input is twice the number of steps for the original input.     The number of steps for the larger input is four times the number of steps for the original input.     The number of steps for the larger input is the square of the number of steps for the original input.     The number of steps for the larger input is more than the number of steps for the original input, but is none of the above.

Programming languages are designed for humans to express human ideas (such as mathematics) in such a way that we can get computers to follow certain requirements.  A parser has to translate OUR words and symbols into tokens, why is this?  in other words why can't the machine just do what we write?

kindly solve this problem using python

describe an algorithm (using pseudocode) whose input is a lust of n integers and output is the total number of odd integers