On Oct 8, 2010, at 13:39, john gilmore wrote:
... Bubble sorts are in fact optimal for key sets that are already very
nearly in sequence; and when a multiset, one containing duplicate keys, is
reordered by a bubble sort it preserves the original ordering of these
duplicates, which is
Paul Gilmartin writes:
begin snippet
multiset or tuple? Wikipedia (which, as you know, is always right) says for
multiset:
In multisets, as in sets and in contrast to tuples,
the order of elements is irrelevant ...
so preserv[ing] the original ordering is an empty notion.
/end snippet
and
John R. Ehrman suggested:
consider donating kernels to IBM as examples of real-world workloads.
Has something changed? The last time (in fact, the last couple of dozen
times) anybody I know tried to give IBM some working code (for various
purposes), they were slapped down immediately, if not
G wrote:
this came up in a thread last year.
Yes, it did. The self-appointed experts were spouting
off as usual, so I had to step in.
HASP uses a word compare, and in a number of tests
I ran those tests (and others that folks sent to me)
and posted the results.
that came out faster than
