| Article ID: | iaor1992158 |
| Country: | United Kingdom |
| Volume: | 18 |
| Start Page Number: | 507 |
| End Page Number: | 513 |
| Publication Date: | Nov 1991 |
| Journal: | Computers and Operations Research |
| Authors: | Elabdalla Abid M. |
| Keywords: | sorting |
This paper considers a modified version of binary insertion trees to sort records on several keys with the possibility of mixing the order of different keys, i.e. ascending on some keys while descending on others.