3 ms·
I have implemented TST (ternary search tree) in C to create fast dictionary (histogram) for counting words in Wikipedia. It is fast and memory efficient.
by aquarin 15y ago
I have implemented TST (ternary search tree) in C to create fast dictionary (histogram) for counting words in Wikipedia. It is fast and memory efficient.
- Cieplak 15y agoAny intentions of open-sourcing it?