How to find relative minimums (maximums)

• 06/07/2023 at 11:19 PM #215788
  Owl888

  Hi,

  I know the HIGHEST[n] function that gives the highest price for the last n candles.

  Is it possible to get the HIGHEST price between 2 candles, say the nth and the mth, something like HIGHEST[n,m] ?

  How to get the candle index corresponding to the HIGHEST output ?

  Thanks

  Fred

  

  Owl888

  Participant

  Topics: 3

  Replies: 9

  Been thanked: 1 time
  06/08/2023 at 12:04 AM #215794
  robertogozzi

  HIGHEST[n,m] is not supported, but you can use:

  HIGHEST[n](source[m]) //source can be anything, CLOSE, HIGH, etc...

  1	HIGHEST[n](source[m])  //source can be anything, CLOSE, HIGH, etc...

   

  

  robertogozzi

  Moderator

  Topics: 69

  Replies: 17269

  Been thanked: 4119 times
  06/08/2023 at 8:42 AM #215820
  JS

  Hi,

  You can search between two different candles for example between candle n and candle m:

  HH = Highest[m-n+1](High[n])

  To find the index of HH you make a loop through the relevant candles with HH as reference.

  For example: HH between candle 3 and 10

  HH = Highest[10-3+1](High[3])

  For i=3 to 10-1

  If High[i] = HH then

  HHBarIndex=BarIndex[i]

  EndIf

  Next

  1 user thanked author for this post.

  Nicolas

  

  JS

  Participant

  Topics: 27

  Replies: 1806

  Been thanked: 876 times
  06/09/2023 at 1:07 PM #215904
  Owl888

  ok, thanks ; I was trying to avoid the loop which can create perf issue if I’m not careful about the range..

  

  Owl888

  Participant

  Topics: 3

  Replies: 9

  Been thanked: 1 time
• Author
  Posts