burstsort.h

目前最快速的字符串排序算法

/* Copyright 2007 Stefan Webb

This file is part of Burstsort.

Burstsort is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

Burstsort is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with Burstsort; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA */

struct Node {
	signed int stringsinbucket;
	union {
		char* bucket;
		unsigned int node;
	};
	char* firstunused;
	char* bottomofbucket;
};

struct Trie {
	unsigned int numnodes;
	Node* nodes;
};

class Burstsort {
	Trie trie;
	bool sorted;
	void burst(unsigned int);
	void sort_bucket(unsigned int);
	bool make_tailpointers(unsigned int);
	unsigned int maxlength;
public:
	Burstsort();
	~Burstsort();
	void insert(wchar_t*);
	void sort();
	void print();
};