HP3000-L Archives

March 2002, Week 1

HP3000-L@RAVEN.UTC.EDU
Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
Re: Sorting:
From:
Bill Cadier <[log in to unmask]>
Reply To:
Bill Cadier <[log in to unmask]>
Date:
Thu, 7 Mar 2002 11:28:16 -0700
Content-Type:
text/plain
Parts/Attachments:
text/plain (31 lines) 
Yup... it's "stable" my ancient copy of "The Design and Analysis
of Computer Algorithms" (Aho/Hopcraft/Ullman) says on page
105...

"A sorting method is stable if equal elements remain in the same
relative order in the sorted sequence as they were in originally."

A couple quick tests of SORT show that it is stable however I do
not know which algorithm it uses.

HTH,

Bill
HP/CSY

----- Original Message -----
From: "ed" <[log in to unmask]>
To: <[log in to unmask]>
Sent: Thursday, March 07, 2002 10:02 AM
Subject: Re: [HP3000-L] Sorting:


> The term is 'stable' (I think.)
>
> * To join/leave the list, search archives, change list settings, *
> * etc., please visit http://raven.utc.edu/archives/hp3000-l.html *
>

* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *

ATOM RSS1 RSS2