s_ins.htm

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

HTM
59 行
字号 
<html>
<head>
<title>Insertion Sort</title>
</head>
<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>Insertion Sort</h1>

One of the simplest methods to sort an array is an insertion sort.
An example of an insertion sort occurs in everyday
life while playing cards.  To sort the cards in your hand you
extract a card, shift the remaining cards, and then insert the
extracted card in the correct place.  This process is repeated
until all the cards are in the correct sequence.  Both average
and worst-case time is <b><i>O</i></b>(<i>n</i><sup>2</sup>).
For further reading, consult
<a href="javascript:if(confirm('http://www.amazon.com/exec/obidos/ISBN=0201896850/none01A/  \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://www.amazon.com/exec/obidos/ISBN=0201896850/none01A/'" tppabs="http://www.amazon.com/exec/obidos/ISBN=0201896850/none01A/" target="_top">Knuth [1998]</a>.

<h2>Theory</h2>
Starting near the top of the array in Figure 2-1(a),
we extract the 3.  
Then the above elements are
shifted down until we find the correct place to insert the 3.
This process repeats in Figure 2-1(b) with the next number.
Finally, in Figure 2-1(c),
we complete the sort by inserting 2 in the
correct place.
<p>
<center>
<h3><a name="Fig2-1">
  <img src="s_fig21.gif" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/niemann/s_fig21.gif" vspace=5 width=559 height=414><br>
  Figure 2-1:  Insertion Sort</a>
</h3>
</center>
<p>
Assuming there are <i>n</i> elements in the array, we must index
through <i>n</i> - 1 entries.  For each entry, we may need to examine
and shift up to <i>n</i> - 1 other entries, resulting in a
<b><i>O</i></b>(<i>n</i><sup>2</sup>) algorithm.
The insertion sort is an <i>in-place</i> sort.  That is, we sort the
array in-place.  No extra memory is required.  The insertion sort
is also a <i>stable</i> sort.  Stable sorts retain the original
ordering of keys when identical keys are present in the input
data.

<h2>Implementation</h2>
An
<a href="javascript:if(confirm('http://www.ee.uwa.edu.au/~plsd210/ds/niemann/s_ins.txt  \n\nThis file was not retrieved by Teleport Pro, because it is linked too far away from its Starting Address. If you increase the in-domain depth setting for the Starting Address, this file will be queued for retrieval.  \n\nDo you want to open it from the server?'))window.location='http://www.ee.uwa.edu.au/~plsd210/ds/niemann/s_ins.txt'" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/niemann/s_ins.txt">ANSI-C implementation</a>
for insertion sort is included.
<b>Typedef T</b> and comparison operator <b>compGT</b>
should be altered to reflect the data stored in the table.

</body>
</html>

s_ins.htm - 源码说明

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

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

⌨️ 快捷键说明

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