📄 index.htm

📁 数据结构词典（英文）
💻 HTM
📖 第 1 页 / 共 5 页
字号:
12 3 4 5 下一页
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<!-- *created  "Fri Sep  4 16:39:08 1998" *by "Paul E. Black" -->
<!-- *modified "Wed Dec 29 12:23:24 1999" *by "Paul E. Black" -->
<TITLE>Dictionary of Algorithms, Data Structures, and Problems</TITLE>
<META name="description"
  content="Definitions of algorithms, data structures, and CS problems.
	Some have links to further information and implementations.">
<META name="keywords" content="algorithm, data structure, traveling
salesman, sorting, searching, tree, hash, graph">
</HEAD>
<BODY BGCOLOR="#FFFFFF">

<CENTER> <H1>Dictionary of Algorithms, Data Structures, and Problems</H1> </CENTER>
<CENTER> <H3>compiled originally for the</H3> </CENTER>
<CENTER> <H2>CRC Dictionary of Computer Science, Engineering and
Technology</H2> </CENTER>

<P>
This is a dictionary of
<em>algorithms</em> [<strong>A</strong>], 
algorithmic <em>techniques</em> [<strong>T</strong>], 
data <em>structures</em> [<strong>S</strong>], and
archetypical <em>problems</em> [<strong>P</strong>], with
related <em>definitions</em> [<strong>D</strong>].
Algorithms include common functions,
such as
<A HREF="ackermann.html" tppabs="http://hissa.nist.gov/dads/HTML/ackermann.html">Ackermann's function</A>.
Problems include 
<A HREF="travelsales.html" tppabs="http://hissa.nist.gov/dads/HTML/travelsales.html">traveling salesman</A> and
<A HREF="byzantine.html" tppabs="http://hissa.nist.gov/dads/HTML/byzantine.html">Byzantine generals</A>.
Some entries have links to further
information and implementations.
Index pages list entries by 
<A HREF="termsArea.html" tppabs="http://hissa.nist.gov/dads/termsArea.html">area</A>, for
instance sorting, searching, or graphs, and by
<A HREF="termsType.html" tppabs="http://hissa.nist.gov/dads/termsType.html">type</A>: <strong>A</strong>,
<strong>T</strong>, <strong>S</strong>, <strong>P</strong>, and
<strong>D</strong>.
A page also lists all
<A HREF="termsImpl.html" tppabs="http://hissa.nist.gov/dads/termsImpl.html">implementations</A>.

<P>
<A name="needHelp">
If you can
define or correct terms, please get in touch with 
<A HREF="javascript:if(confirm('http://hissa.nist.gov/~black/  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/'" tppabs="http://hissa.nist.gov/~black/">me</A>.
We need help in graphs, state machines, combinatorics, parallel
and randomized algorithms, and heuristics.
Algorithms particular to communications and information processing,
operating systems, programming languages, AI, graphics, etc. were
handled by other groups.
</A>

<P>
If you want terms dealing with hardware, the computer
industry, slang, etc., try the
<A HREF="javascript:if(confirm('http://foldoc.doc.ic.ac.uk/  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://foldoc.doc.ic.ac.uk/'" tppabs="http://foldoc.doc.ic.ac.uk/">Free
On-Line Dictionary Of Computing</A>.  If you don't find a
term with a leading variable, such as <em>n</em>-way,
<em>m</em>-dimensional, or <em>p</em>-branching, look under
<A HREF="#K"><em>k</em>-</A>.

<HR>

<!-- this is joined with the entries and a conclusion to make a
	complete page -->
<!-- end of terms.intro -->

<h3><a href="#A">A</a>
<a href="#B">B</a>
<a href="#C">C</a>
<a href="#D">D</a>
<a href="#E">E</a>
<a href="#F">F</a>
<a href="#G">G</a>
<a href="#H">H</a>
<a href="#I">I</a>
<a href="#J">J</a>
<a href="#K">K</a>
<a href="#L">L</a>
<a href="#M">M</a>
<a href="#N">N</a>
<a href="#O">O</a>
<a href="#P">P</a>
<a href="#Q">Q</a>
<a href="#R">R</a>
<a href="#S">S</a>
<a href="#T">T</a>
<a href="#U">U</a>
<a href="#V">V</a>
<a href="#W">W</a>
<a href="#X">X</a>
<a href="#Y">Y</a>
<a href="#Z">Z</a>
</h3>
<TABLE BORDER=0 WIDTH="100%">
<TR>
<TD valign=top>
<a name="A"><h2>A</h2>

<dl>
<dt><a href="absolute.html" tppabs="http://hissa.nist.gov/dads/HTML/absolute.html"><em>absolute performance guarantee</em></a> [<strong>D</strong>]
<dt><a href="abstracdtype.html" tppabs="http://hissa.nist.gov/dads/HTML/abstracdtype.html"><em>abstract data type</em></a> [<strong>D</strong>]
<dt><a href="abtree.html" tppabs="http://hissa.nist.gov/dads/HTML/abtree.html"><em>(a,b)-tree</em></a> [<strong>S</strong>]
<dt><a href="acceptingstt.html" tppabs="http://hissa.nist.gov/dads/HTML/acceptingstt.html"><em>accepting state</em></a> [<strong>D</strong>]
<dt><a href="ackermann.html" tppabs="http://hissa.nist.gov/dads/HTML/ackermann.html"><em>Ackermann's function</em></a> [<strong>A</strong>]
<dt><a href="acyclicdgrph.html" tppabs="http://hissa.nist.gov/dads/HTML/acyclicdgrph.html"><em>acyclic digraph</em></a> [<strong>D</strong>]
<dt><a href="acycdirgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/acycdirgraph.html"><em>acyclic directed graph</em></a> [<strong>D</strong>]
<dt><a href="acyclicgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/acyclicgraph.html"><em>acyclic graph</em></a> [<strong>D</strong>]
<dt><a href="adaptive.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptive.html"><em>adaptive</em></a> [<strong>D</strong>]
<dt><a href="adaptivehpsr.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptivehpsr.html"><em>adaptive heap sort</em></a> [<strong>A</strong>]
<dt><a href="adaptivhuffm.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptivhuffm.html"><em>adaptive Huffman encoding</em></a> [<strong>A</strong>]
<dt><a href="adaptkdtree.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptkdtree.html"><em>adaptive k-d tree</em></a> [<strong>S</strong>]
<dt><a href="addresscalc.html" tppabs="http://hissa.nist.gov/dads/HTML/addresscalc.html"><em>address-calculation sort</em></a> [<strong>A</strong>]
<dt><a href="adjcncymtrxr.html" tppabs="http://hissa.nist.gov/dads/HTML/adjcncymtrxr.html"><em>adjacency-matrix representation</em></a> [<strong>S</strong>]
<dt><a href="adjacent.html" tppabs="http://hissa.nist.gov/dads/HTML/adjacent.html"><em>adjacent</em></a> [<strong>D</strong>]
12 3 4 5 下一页
⌨️ 快捷键说明

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