﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>IT博客-这里的黄昏静悄悄-随笔分类-数据结构</title><link>http://www.cnitblog.com/jackrain/category/595.html</link><description>I Like C++</description><language>zh-cn</language><lastBuildDate>Mon, 26 Sep 2011 13:44:25 GMT</lastBuildDate><pubDate>Mon, 26 Sep 2011 13:44:25 GMT</pubDate><ttl>60</ttl><item><title>哈希表及相关</title><link>http://www.cnitblog.com/jackrain/archive/2005/08/14/1882.html</link><dc:creator>这里的黄昏静悄悄</dc:creator><author>这里的黄昏静悄悄</author><pubDate>Sun, 14 Aug 2005 03:54:00 GMT</pubDate><guid>http://www.cnitblog.com/jackrain/archive/2005/08/14/1882.html</guid><wfw:comment>http://www.cnitblog.com/jackrain/comments/1882.html</wfw:comment><comments>http://www.cnitblog.com/jackrain/archive/2005/08/14/1882.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnitblog.com/jackrain/comments/commentRss/1882.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/jackrain/services/trackbacks/1882.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Hashing定义了一种将字符组成的字符串转换为固定长度(一般是更短长度)的数值或索引值的方法，称为散列法，也叫哈希法。由于通过更短的哈希值比用原始值进行数据库搜索更快，这种方法一般用来在数据库中建立索引并进行搜索，同时还用在各种解密算法中。&nbsp;&nbsp;&nbsp; 　设所有可能出现的关键字集合记为U(简称全集)...&nbsp;&nbsp;<a href='http://www.cnitblog.com/jackrain/archive/2005/08/14/1882.html'>阅读全文</a><img src ="http://www.cnitblog.com/jackrain/aggbug/1882.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/jackrain/" target="_blank">这里的黄昏静悄悄</a> 2005-08-14 11:54 <a href="http://www.cnitblog.com/jackrain/archive/2005/08/14/1882.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>