RE: An introduction to MI by example III (part A)...

great explanation, Phil !

>     DESCENDING-SORT-COMPARE:
>         CMPBLA(B)  ELEMENT(ITEM-NBR), ELEMENT(COMP-NBR)
>                    /LO(SORT-SWAP),    NLO(SORT-COMPARE);
> 
> Here, the current element 'ITEM-NBR' is compared with the selected
> element 'COMP-NBR'. Depending upon the sort sequence they're swapped (a
> branch to 'SORT-SWAP') or if they are already in the sort order, a
> branch to 'SORT-COMPARE' is made.
> 
        [Leif Svalgaard]  I just want to add that you can more than one test
on
        the (B) instructions as shown in the above example, where we jump
        to SORT-SWAP if the result was LO (lower) or to SORT-COMPARE
        if the result was NLO (not lower - i.e. otherwise).

+---
| This is the MI Programmers Mailing List!
| To submit a new message, send your mail to MI400@midrange.com.
| To subscribe to this list send email to MI400-SUB@midrange.com.
| To unsubscribe from this list send email to MI400-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: dr2@cssas400.com
+---