approx 100 assorted computer/ math/other books

Phil... rynes at ieee.org
Tue Oct 21 23:46:36 EDT 2003


Here is a sorting method that has the potential of being the fastest.
1. check if sorted, if so you are done
2. randomize the collection, go to 1

"rzed" <Dick.Zantow at lexisnexis.com> wrote in message
news:bn3fge$jup$1 at mailgate2.lexis-nexis.com...
> David Rubin wrote:
> > tnrABC at canadawired.com wrote:
> >
> > [snip - list of assorted computer/math/other books]
> >
> > I'm not familiar with the assort. Can you explain the algorithm?
> >
>
> Properly speaking, this is the "as sort" -- that is, sorted as you
> would like it to be. The arguments most implementations accept are
> "if", "is", or <something else>.
>
> The "as is" sort is the most time-efficient, but boring, variation
>
> The "as if" sort is the most fantastic, but in some of the newer
> implementations it produces no usable results apart from denial that
> any actual action is necessary.
>
> The "as something else" sort is more complex and its exact effect
> depends on the something specified. For example: an "as telephone
> numbers" sort will substitute the digits from a telephone keypad for
> letters in the text and sort accordingly. See the manual for more
> information.
>
> Hope that helps.
>
> --
> rzed
>
>






More information about the Python-list mailing list