Path: utzoo!attcan!uunet!mcvax!ukc!tcdcs!tcdmath!mlloyd
From: mlloyd@maths.tcd.ie (Michael Lloyd)
Newsgroups: comp.sys.mac.hypercard
Subject: Sorting Efficiently
Message-ID: <670@maths.tcd.ie>
Date: 10 Mar 89 19:53:25 GMT
Reply-To: mlloyd@maths.tcd.ie (Michael Lloyd)
Organization: Maths Dept., Trinity College, Dublin
Lines: 27

This is a rather esoteric one, I reckon, and will probably require fairly
in-depth knowledge of sorting.

A friend is developing a large bibliographic stack - by large, I mean ~700
cards thus far, with no end in sight.  When references are added, they are
done via New Card at the end of the stack.  After an adding session, they have
to be inserted alphabetically into the card order - hence a sort command.

My question is, as this sort takes long enough to be VERY irritating (it needs
doing very often), would there be any better place to create new cards?  I
might (wildly) guess that cards created at the START of the stack might speed
up the process - this could happen if the cards are treated in order when
sorts go into action.

Anyone got anything to say?

I have a few other equally obscure queries which I might circulate if I get
any joy on this one.

Thanks,

Mike.

Mike Lloyd, Dept of Statistics, |
Trinity College, Dublin,        |      "COGITO, ERGO CHICO & ZEPPO"
Ireland.                        |          Tonio K.
(mlloyd@maths.tcd.ie)           |