As I don't know PL/I or PLX and this is the Assembler list, let's talk
assembler.
You stated that your code produced a binary search against a table where
each row was variable length.
I said binary search can't work on such a table.
So, produce the code in assembler.
Tony Thigpen
-----Original Message -----
From: robin
Sent: 10/25/2013 08:12 AM
From: "Tony Thigpen" <t...@vse2pdf.com>
Sent: Friday, October 25, 2013 10:05 PM
Convert your PLX code to assembler and you will see that you are binary
searching a pointer table that has fixed length entries.
In PL/I , each string value (= each element of an array) occupies
exactly the same storage.
