Huffman tree ???
On Fri, Aug 10, 2012 at 11:38 PM, Varma Selvaraj varm...@gmail.com wrote:
A data cache needs to be implemented for the top 100 data items selected
based on their frequency of access.
The most frequent data member must be accessed fastest. And the access
time/iterations
I think best data structure would be Optimal BST
On Fri, Aug 10, 2012 at 11:47 PM, Kumar Vishal kumar...@gmail.com wrote:
Huffman tree ???
On Fri, Aug 10, 2012 at 11:38 PM, Varma Selvaraj varm...@gmail.comwrote:
A data cache needs to be implemented for the top 100 data items selected
It very much looks to be max heap with frequency as value. So maximum
frequent item will be the root and so on. O(logN) complexity for search
On Sat, Aug 11, 2012 at 1:18 PM, Navin Kumar algorithm.i...@gmail.comwrote:
I think best data structure would be Optimal BST
On Fri, Aug 10, 2012 at
A data cache needs to be implemented for the top 100 data items selected
based on their frequency of access.
The most frequent data member must be accessed fastest. And the access
time/iterations of each data member from the cache should correspond to the
frequncy of its access.
Please choose
