| I'm not sure why they want to know, since it's not something that they
can modify; it must be for curiosity only.
In any case, the sort method used is a tree sort. (While a bubble sort
might be the easiest for a first-year BASIC programmer to use, it wouldn't get
any kind of performance!) Basically, the /SORT causes all records to be read
into the phantom DSAB immediately; it then allocates some virtual memory, goes
through the records one by one, and puts them into a tree structure, based on
their key of reference in relation to other records already in the tree.
If your customer was *truly* interested in the details, they could look
in the Journal of the ACM, Vol. XVIII No. 20, for more information. Or Derek
could help fill in other useful details. 8^)
F
|
| Hi Keiko !
As far as I know, BIND/SORT uses the sorting table for ISO Latin 1 as
defined in the VMS NCS Utility. But !!!!! (Lot's of drum rolls....)
Thanks to Derek Allen, in V3 you can specify the name of the sort table
to use. (Or has it been canceled ....).
Richard
|
| As I recall, BIND/SORT always used a table (defined in OALLV as
oa$at_data_sort_table) since it was first added. The comments in the
code date this addition as 7/8/89, so it should certainly have been in
V2.4 too!
I certainly *hope* we have I18N uppermost in our minds!
Graham
|