s_dic.htm

来自「Data Structure Ebook」· HTM 代码 · 共 22 行

HTM
22 行
字号 
<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>

s_dic.htm - 源码说明

本页面展示了「Data Structure Ebook」中的 s_dic.htm 源码文件，采用 HTM 编程语言编写，共 22 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Structure相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?