Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <manber_myers_log2.h>
Classes | |
struct | Suffix |
Constructs suffix array in O(n (log n)^2) time with Mamber-Myers algorithm, but using std::sort instead of countsorts.
The implementation uses 4N ints of memory. The code is based on original from Michal Forisek.