Editing ALGORITHM I (section)

==='''Step II. Searching for Points 3 and 2.'''===
If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.

The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.
: '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.
: '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.
:: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)<ref> Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).</ref>, the program checks the next bar in accordance with step 2.
:: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then
::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.
:::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.
:::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.
::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for "extremity" according to N1 rule. Two variants are possible <ref>As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2</ref>:
:::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.
:::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.

If the program has processed 50 bars <ref>The range of continuous search is t.3 in one iteration for all models except EAM</ref> in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.

If there are 150 or more bars <ref>Maximum search range t3 for all models except EAM</ref> between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.