Implements "Algorithm M: Covering with Multiplicities and Colors."
-
Updated
Nov 15, 2022 - C++
Implements "Algorithm M: Covering with Multiplicities and Colors."
There are two implementations available in this folder in C/C++. First one is of Dynamic Hashing using Binary Tree with Page size at each node. The second one is of Knuth Hash Function performance evaluation using a text file as input.
Add a description, image, and links to the knuth topic page so that developers can more easily learn about it.
To associate your repository with the knuth topic, visit your repo's landing page and select "manage topics."