- Windows Develop
- File Size:
- Uploaded by:
Description: There is a bi-directional circular linked list. In addition to prior, data and next domains, freq is added to each node. Before the list is used, the freq value in frequency domain is initialized to zero, and every time a locate (L, x) operation is performed on the list, the freq value in frequency domain in the visited node (i.e., the node whose element value equals x) is increased by 1. At the same time, the order of the nodes in the list is adjusted so that they are arranged in a non-decreasing order of visiting frequency so as to keep the frequently visited nodes at all times. The point is always close to the head node. Try to write an algorithm for locate operation that meets the above requirements.
(Click to check if it's the file you need, and recomment it at the bottom):
|locate.txt|| 1398 || 2019-03-16
|线性表.docx|| 26658 || 2019-03-16|