My problem seems again rather elementary, but I didn't find
any references for it and can't resolve it.
It's simply how to find the nearest pivots in the daily pivots array,
either above or below a known entryprice. So it would be simply to find the rank of the entryprice inside the sort array
hello and thank you very much for your answer.
I saw this thread indeed, but it seemed much more complexe
to me, as I thought my question was easier to solve.
in fact the array is already sorted and only the rank
of the entryprice needs to be found inside this sorted array.