Editing ALGORITHM II (section)

==='''Step II. Search For Potentioal Points 5 and 4 ''' ===
 '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''
  If point 3 is low, then the level of point 5 should be higher than point 3. 
  If point 3 is high, then the level of point 5 should be lower than point 3.
'''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since  N1 requirement for Algorithm II must be observed).
:'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).
:'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).
::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.
::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:
:::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).
:::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.
:'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:
::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.
:::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:
::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.
::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.
:::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.
::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).
 If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.
 If there are 150 or more bars<ref>Continuous search range of t.5 in one iteration for EAM model</ref> between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.
:'''2.4.''' Real-Time Verification of t.5 
:The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:
::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.
::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).