-
-
-
[
Visual C++ (VC++)]
search.rar
... probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).
-
[
Delphi]
tochkisrc.zip
Delphi realization of well-known points game. Compiles with Delphi 7. Demonstrates simple depth search with some heuristics in estimate function.
-
-
-
-
-
-
[
Java/JSP]
jw-spider.rar
network spiders, from a website, the search network, including setting function of the depth of search. dynamic display of search results.
-
[
Java/JSP]
spider666.rar
java achieve network spiders, this is a basic search function and can expand their own needs