Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!cs.utexas.edu!uunet!brunix!man
From: man@cs.brown.edu
Newsgroups: comp.sys.mac.hypercard
Subject: Sorting gets very slow
Message-ID: <14843@brunix.UUCP>
Date: 11 Sep 89 14:35:15 GMT
Sender: news@brunix.UUCP
Reply-To: man@cs.brown.edu ()
Organization: Brown University Department of Computer Science
Lines: 9

I've developed a stack for use as a bibliographic database supporting
BibTeX format.  I'm getting a report from a user that his stack, which
is about 1.2 meg, takes around 20 minutes to sort using HyperCard's
builtin sort routine.  Why is this so slow?  Did they use an n log n
algorithm for the sort?  Is there any way of writing an XCMD to do the
sorting which might work faster?


	--Mark