Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!usc!samsung!munnari.oz.au!ariel!ucsvc.ucs.unimelb.edu.au!lu!miuron
From: MIURON@lure.latrobe.edu.au
Newsgroups: comp.lang.pascal
Subject: Binary tree sort - help reqd.
Message-ID: <4892@lure.latrobe.edu.au>
Date: 11 Dec 90 22:11:09 GMT
Organization: VAX Cluster, Computer Centre, La Trobe University
Lines: 14

I have been trying to develop a sort routine which utilizes a binary tree 
sort with dynamic variables.  I have managed this to some extent.  I can
sort on two keys using a two recursive procedures; one creates a binary 
tree which sorts on the first key, and the second binary tree called from 
within the first procedure to sort on the second key.  

What I have works, but I don't want to limit myself to only two keys.  I 
would like the program to accept any number of keys.  I can't help thinking
that recursion is the answer, but I have already turned my brain inside
out getting to this stage.  If anyone knows of a routine which might be
close to what I want I'd appreciate you contacting me.


Ron Crichton