📄 s_dic.htm
字号:
<html>
<body bgcolor="#ffffff">
<p align=right>
<a href="s_man.htm" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/niemann/s_man.htm" target="_top"><img src="c_man.gif" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/niemann/c_man.gif" width=74 height=19 border=0></a>
</p>
<h1>Dictionaries</h1>
<em>Dictionaries</em> are data structures that support <em>search</em>,
<em>insert</em>, and <em>delete</em> operations. One of the most
effective representations is a <em>hash table</em>. Typically, a
simple function is applied to the key to determine its place in the
dictionary. Also presented are <em>binary trees</em> and
<em>red-black trees</em>. Both <em>tree</em> methods use a technique
similar to the binary search algorithm to minimize the number of comparisons
during search and update operations on the dictionary.
Finally, <em>skip lists</em> illustrate a simple approach that utilizes
random numbers to construct a dictionary.
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -