Purpose
The program demonstrates the access times for an internal table with andwithout a secondary key. A three-column internal table is scanned onceusing the specification of a free key and once using the specificationof a sorted secondary key, looking for an entry which does not exist inthe table. Whilst with the free key, all table rows have to be scanned;using the secondary key a binary search takes place.