用二次探测再散列法解决冲突建立哈希表并查找

[{"title":"（18个子文件289KB）用二次探测再散列法解决冲突建立哈希表并查找","children":[{"title":"Hash","children":[{"title":"Hash.c <span style='color:#111;'>1.45KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Hash.pdb <span style='color:#111;'>489.00KB</span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'>68.00KB</span>","children":null,"spread":false},{"title":"Hash.pch <span style='color:#111;'>183.39KB</span>","children":null,"spread":false},{"title":"Hash.ilk <span style='color:#111;'>207.82KB</span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'>41.00KB</span>","children":null,"spread":false},{"title":"Hash.obj <span style='color:#111;'>8.14KB</span>","children":null,"spread":false},{"title":"Hash.exe <span style='color:#111;'>208.05KB</span>","children":null,"spread":false}],"spread":true},{"title":"Hash.opt <span style='color:#111;'>53.50KB</span>","children":null,"spread":false},{"title":"Hash.ncb <span style='color:#111;'>49.00KB</span>","children":null,"spread":false},{"title":"Hash.h <span style='color:#111;'>1.68KB</span>","children":null,"spread":false},{"title":"Data.txt <span style='color:#111;'>248.00KB</span>","children":null,"spread":false},{"title":"Hash.dsw <span style='color:#111;'>514B</span>","children":null,"spread":false},{"title":"运行结果.png <span style='color:#111;'>31.09KB</span>","children":null,"spread":false},{"title":"Hash.o <span style='color:#111;'>2.54KB</span>","children":null,"spread":false},{"title":"Hash.plg <span style='color:#111;'>1.20KB</span>","children":null,"spread":false},{"title":"Hash.dsp <span style='color:#111;'>4.22KB</span>","children":null,"spread":false},{"title":"Hash.exe <span style='color:#111;'>28.34KB</span>","children":null,"spread":false}],"spread":false}],"spread":true}]