On Wed, 24 Feb 1999, Robert McConnell wrote:
> Ok, what happens if the point moves again before the sort is complete?
> Do you complete that one, or terminate and start over? If you terminate
> and start over, what happens if the sort never gets out to some points?
Interesting question ... but that probably depends on the problem. I
would guess that the sorting doesnŽt make much sense if it isnŽt fast
enough to complete before the point moves again (at least half the time or
so). Because if it is too slow, the array will be unsorted most of the
time! In that case, youŽd need a better algorithm or faster JIT or
machine. IŽd guess that Chris doesnŽt sort the array just for fun, but
wants to use the values in it for something - so a "sorted" state needs
to be achieved every once in a while. Using a listener, you could also
have a flag indicate whether or not the array is sorted at the moment,
which is set to false as soon as the point moves. You canŽt do that when
the sorting algorithm runs all the time.
But this is already going off topic for this list (albeit an interesting
question, I have to say ...).
Best,
Robert
***************************************************************************
Try to value useful qualities in one who loves you.
***************************************************************************
_ email: [EMAIL PROTECTED]
/_)_ / __ __ 7 //_ _ __ __ __ or: [EMAIL PROTECTED]
/ \(_)/_)(- / / /\(_)_\(_// (_/ http://www.ifs.tuwien.ac.at/~rkosara/
*** Student of Computer Science and Medicine in Vienna, Austria, Europe ***
***************************************************************************
----------------------------------------------------------------------
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
