/compact-tree

This is a study into condensing unstructured data into an n-tree. This should aid in finding/verifying unstructured data in O(log2(N)) (and storing in O(N)).

Primary LanguageC

compact-tree

This is a study into condensing unstructured data into an n-tree.
This should aid in finding/verifying unstructured data in O(log2(N)) (and storing in O(N)).