Search
18:35:53
shka_
jcowan: i am literally doing what is described in "A simple shuffle-based stable in-place merge algorithm" by Mehmet Emin Dalkilic
18:38:13
shka_
i think that once i have in-place merge ready, actual merge-sort should be rather easy to implement
18:39:17
shka_
article contains experimental comparison with classical merge
18:39:48
shka_
shuffle merge is slower, but not by a lot
18:46:17
shka_
jcowan: I thing that it would be the best to implement several sorting algorithms and then compare them against each other
18:46:53
shka_
then the best one, or perhaps some optimal combination could be used in SICL
18:47:48
shka_
i am doing this particular one not only because it seems to be good, but also because of the coolness factor
18:49:07
shka_
therefore it is very possible that this is not the idea way of doing things ;-)
18:52:00
shka_
needless to say, i urge you to contribute
19:00:58
beach
ACTION is off to spend time with is (admittedly small) family.
19:55:59
jcowan
my main contribution will have to be to point to https://github.com/scheme-requests-for-implementation/srfi-132/tree/master/sorting
19:56:23
jcowan
which is admittedly in Scheme, but should be completely readable modulo inserting the occasional `funcall` mentally.
4:32:54
beach
Good morning everyone!
4:33:08
beach
jcowan: There doesn't seem to be any documentation or README. What does it do?
4:50:28
Gnuxie[m]
Good morning beach