full text search engine based on compact data structures
-
Updated
Jan 26, 2015 - C++
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
full text search engine based on compact data structures
A Binary tree and AVL tree type data structure library that can hold key-value pairs.
My C/C++ implementation of balanced binary search tree - 2,3-tree
Data Structures Project: A stack based calculator program that takes an algebraic equation (infix notation) from the user, converts it to reverse polish notation (postfix) and finally prints the output to the user.
Visualization of common algorithms
STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.
A C++ data structre (essentially a standard tree, but with features needed for state systems)
An implementation of a trie data structure in f#
TagGraph is a graph like data structure for creating tag hierarchies in Go apps.
Garbage collected concurrent hash tries.