Hi,
sorty v0.4.0 is released with:
// Sort3 concurrently sorts underlying collection of length n via
// lesswap() which must be equivalent to:
// if less(i, k) {
// if r != s {
// swap(r, s)
// }
// return true
// }
// return false
func Sort3(n int, lesswap func(i, k, r, s int) bool)
This function based method is faster than sorty.Collection2, which in turn
is faster than sort.Interface (just as a way to access generic collections).
Let me know what you think, cheers..
On Wednesday, September 25, 2019 at 10:17:40 PM UTC+3, Serhat Şevki Dinçer
wrote:
>
> Hi everyone,
>
> I've been improving type-specific concurrent sorting library sorty
> <https://github.com/jfcg/sorty> for a while and the results seem really
> competitive on different data types for such a small library (effective
> code is less than 200 lines). It also implements sort.Interface, though no
> stable sorting or worst case guarantees yet.
>
> Let me know what you think. I am especially interested on sorting timings
> on non-x86 platforms.
>
> Thanks..
>
--
You received this message because you are subscribed to the Google Groups
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to golang-nuts+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/golang-nuts/8e938595-3d45-437b-a386-e44abe03c095%40googlegroups.com.
