coderodde.c.utils

The main aim of this project is to provide implementations of most fundamental data structures and algorithms.

TODO:

• map (a ordered map using a AVL-tree)
• set (a ordered set using a AVL-tree)
• unordered_map (a unordered map using a hash table)
• unordered_set (a unordered set using a hash table)
• heap (a d-ary heap)
• fibonacci_heap
• list (an array based list supporting fast insertion/removal from both ends)

POSSIBLY:

• stable_sort (a natural merge sort)
• parallel_stable_sort (a parallel natural merge sort) - provided that the future versions of C library include portable thread facilities.
• integer_sort (a radix sort)
• parallel_integer_sort (a parallel radix sort) - provided that the future versions of C library include portable thread facilities.