When a programmer uses the read command, the table
is sequentially searched. This slows down the processing. Instead of this, use
the binary search addition. The binary search algorithm helps faster search of a
value in an internal table. It is advisable to sort the internal table before
doing a binary search. Binary search repeatedly divides the search interval in
half. If the value to be searched is less than the item in the middle of the
interval, the search is narrowed to the lower half, otherwise the search is
narrowed to the upper half.
Read table int_fligh with key airln = ‘LF’.
Read table int_fligh with key airln = ‘LF’ binary search.