- Category:
- CSharp
- Tags:
-
[C/C++]
[源码]
- File Size:
- 1kb
- Update:
- 2013-01-17
- Downloads:
- 1 Times
- Uploaded by:
- hac
Description: Has a pointer to L, non-circular doubly linked list with a header node, each node in addition to prev (precursor pointer), data (data) and next (the successor pointer) extraterritorial, as well as a visit to the frequency degree domain freq. Before the list is hired, their values are initialized to zero. Whenever the time the Locate (L, x) operator in the list, so that the elements of value of the freq domain value in the node x is increased by 1, and frequency-access node in the linked list to keep non-increasing (decreasing) the order, while the most recently accessed nodes ranked in the frequency of the same node last, so that the frequently accessed node is always close to the header. Ciphering algorithms test preparation the Locate (L, x) meets the above requirements, the operator as a function of the process, and return to find the address of the node type is a pointer type.
To Search:
File list (Check if you may need any files):
Locate.cpp
Download