Message from Python discussions

December 2018

— HAO

— 

I tought at first that opens[-2] would do the trick but i need to do it recursively trough all the list

— So i think i need an aditional forloop

— Use simple list comprehension

— Much easier to read and write

— Yes i've found solution using forloop

— 

    hsopens=[(opens[i-1] + closes[i-1])/2 for i, x in enumerate(opens) if i > 0]

— A friend of other group helped

— Good

— I am now in another subject

— Now that i have the 2 formulas solved

— I need to 'select' the highest high, low, open or close in each given iteration of the forloop