-
stefanwebb changed the public information on the Burstsort project.
2009-09-13 06:51:33 UTC by stefanwebb
-
Type Burstsort into Wikipedia.
2007-08-04 21:29:21 UTC by stefanwebb
-
Actually it does scale well, that's why it's such a good algorithm. You should type Burstsort into Google Scholar if you want documents describing the algorithm. New version should work under Linux as it's just standard C++ library. Not too sure about wide character stream though.
2007-08-04 21:28:31 UTC by stefanwebb
-
Would be nice if you could supply some of the research papers (as links) you are referring to with your implementations.
- Wolfgang.
2007-07-29 13:44:58 UTC by kse
-
+
+ //keep the memory from leaking out, we should never need more than 4 byt
es for the pointer to the next node
+ free(trie.nodes[node].bucket);
+ trie.nodes[node].bucket = (char*) malloc(sizeof(char) * 4);
+
what about:
- trie.nodes[node].bucket = (char*) malloc(sizeof(char) * 4);
+ trie.nodes[node].bucket = (char*) malloc(sizeof(*char));
?.
2007-07-13 18:52:09 UTC by goewe
-
Here is a patch to build under Linux and presumably under other *nixen.
Build command:
g++ -I . -o burst -g *cpp
Nice little algorithm. It's about 1/2 the time of textutils sort on the dictwords.txt, though it may not scale as well.
I'd be super interested in a java implementation. Do you have a document that describes the algorithm?.
2007-07-10 21:30:09 UTC by paulprogrammer
-
I went ahead and made a version of your Burstsort library that can be built on Linux without Winelib. I'm uploading it as an attachment to this message. It is minimally different from your Windows/Winelib Burstsort.
Importantly, I had to substitute fopen() for _wfopen(), and I fixed several subtle memory bugs, some of which were found by using the 'valgrind' program.
All occurrences of...
2007-06-29 06:43:16 UTC by godless
-
I went ahead and made a version of your Burstsort library that can be built on Linux without Winelib. I'm uploading it as an attachment to this message. It is minimally different from your Windows/Winelib Burstsort.
Importantly, I had to substitute fopen() for _wfopen(), and I fixed several subtle memory bugs, some of which were found by using the 'valgrind' program.
All occurrences of...
2007-06-29 06:09:08 UTC by godless
-
It isn't a big deal but I noticed in the burst method of the Burstsort class if a node is created the old nodes bucket isn't cleaned up even though it will only be used again as an integer. Attached is a patch which I believe fixes the little leak in this method.
2007-06-20 20:39:37 UTC by marquedios
-
Burstsort is a library for sorting strings, and is currently the fastest algorithm for doing so, being much faster than Quicksort and Radixsort. It has applications to computational linguistics, genomics, and many other areas of science where sorting strings is required.
https://sourceforge.net/projects/burstsort.
2007-05-29 15:56:16 UTC by stefanwebb
