Z-Tree Demo is a simple application showing how to sort huge files of several GB with Z-Tree. ZTree ZMemoryPool Demo also demonstrates how to use Z-tree for key-value mapping.

Z-Tree is a new data structure for sorting, key-value mapping and multiple other purposes.

Sorting with Z-Tree is not based on comparison and the time complexity of sorting with Z-Tree is O(n). Z-Tree is capable of sorting big files of several GB in memory.

For key-value mapping, the time complexity of adding a key/value or finding a value by key is O(1).

Z-Memory Pool is designed for C/C++ to allocate a large amount of memory. Z-Memory is capable of preventing memory leak and detecting memory overflow.

For more information about Z-Tree document and source code, please refer to http://www.ztreesoft.com.