I have seen implementations in C++, but I want to know if I can optimize my current implementation in my language of choice. I want to understand how I can optimize this solution in PYTHON. If I use the Webpage class to track visits instead of the hashtable I would still need to update the hashtable every time I visit a site. I don't think I can update the heap "on the go". In my implementation, I did not use the Webpage class as I can't think of an efficient way we could update the heap based on visits unless we did heapify again. You can efficiently tell the top 5 visited websites on basis of the number of visits (in any order) Design and implement a web browser that supports the functionality that at any given instance
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |