FAQ
PTAL

Stable sorting uses O(n*log(n)*log(n)) calls to Swap,
a crude derivation of this is included at the bottom of
sort.go. The O(n**1.16) was a good but purely empirical
fit as Russ pointed out.

I included remarks on other algorithms evaluated in a
comment.

Patchset #10 can be reviewed properly but I'll be awfk
from Friday until end of June.

For the curious: Experimental data on numbers of calls
to Sort and Less sorting random ints can be found in
http://i.imgur.com/fmZLKx5.png
The fits are n*log^2(n) for the number of Swaps in Stable
and n*log(n) for all the other numbers.

v.





https://codereview.appspot.com/9612044/

--

---
You received this message because you are subscribed to the Google Groups "golang-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email to golang-dev+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

Search Discussions

Related Discussions

Discussion Navigation
viewthread | post
Discussion Overview
groupgolang-dev @
categoriesgo
postedJun 5, '13 at 10:43a
activeJun 5, '13 at 10:43a
posts1
users1
websitegolang.org

1 user in discussion

Dr Volker Dobler: 1 post

People

Translate

site design / logo © 2021 Grokbase