There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
Implementation of structs (2 hash tables 1 heap) to keep a database of CDRs (call detail records) in the main memory. The two has tables are used to have instant O(1) access to the records. One hash table where the records are stored by caller and one that the records are stored by callee. The binary heap is used to find the top k% of the earnings from the calls.