📄 externalsort.html

📁 数据结构词典（英文）
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>external sort</TITLE>
<META name="description"
  content="Definition of external sort,
	possibly with links to more information and implementations.">
<META name="keywords" content="external sort">
</HEAD>
<BODY BGCOLOR="#FFFFFF">

<H1>external sort</H1>
<P>
(definition)

<P>
<strong>Definition:</strong>
Any <a href="sort.html" tppabs="http://hissa.nist.gov/dads/HTML/sort.html"><em>sort</em></a> algorithm which uses external memory, such as tape or disk, during the sort.  Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.
<P><strong>See also</strong>
<a href="internalsort.html" tppabs="http://hissa.nist.gov/dads/HTML/internalsort.html"><em>internal sort</em></a>, <a href="balncdmltwym.html" tppabs="http://hissa.nist.gov/dads/HTML/balncdmltwym.html"><em>balanced multiway merge</em></a>, <a href="cascademerg.html" tppabs="http://hissa.nist.gov/dads/HTML/cascademerg.html"><em>cascade merge sort</em></a>, <a href="externmrgsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/externmrgsrt.html"><em>external merge sort</em></a>, <a href="optpolymrg.html" tppabs="http://hissa.nist.gov/dads/HTML/optpolymrg.html"><em>optimal polyphase merge sort</em></a>, <a href="oscillatmerg.html" tppabs="http://hissa.nist.gov/dads/HTML/oscillatmerg.html"><em>oscillating merge sort</em></a>, <a href="polyphmrgsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/polyphmrgsrt.html"><em>polyphase merge sort</em></a>, <a href="extrnlrdxsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/extrnlrdxsrt.html"><em>external radix sort</em></a>, <a href="externalmerg.html" tppabs="http://hissa.nist.gov/dads/HTML/externalmerg.html"><em>external merge</em></a>.
<P><em>Note:
Algorithms may read the initial values from magnetic tape or write sorted values to disk, but this is not using external memory during the sort.  Note that even though virtual memory may mask the use of disk, sorting sets of data much larger than main memory may be much faster using an explicit external sort.</em>
<P>Author: <a href="terms.html#authorPEB" tppabs="http://hissa.nist.gov/dads/terms.html#authorPEB">PEB</a>

<hr>

Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.

<hr>

If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html  \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/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
&nbsp;(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).

<p>
Entry modified Tue Jun 15 11:30:25 1999.<BR>
HTML page formatted Wed Dec 22 09:35:18 1999.

<P>
This page's URL is
<A href="externalsort.html" tppabs="http://hissa.nist.gov/dads/HTML/externalsort.html">http://hissa.nist.gov/dads/HTML/externalsort.html</A>

</BODY>
</HTML>
⌨️ 快捷键说明

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