C++各种常见排序算法冒泡排序，插入排序，快排序，选择排序，希尔排序

浅浅的花香味﹌ 2022-06-10 10:12 341阅读 0赞

### BubbleSort.cpp ~ 657B [ 下载][Link 1](216) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// BubbleSort.cpp: implementation of the CBubbleSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "BubbleSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CBubbleSort::CBubbleSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CBubbleSort::~CBubbleSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code>void</code> <code> CBubbleSort::Sort (</code><code>int</code> <code> * arr,</code><code>const</code> <code> int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* BubbleSort.h ~ 613B [ 下载][Link 2](167) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// BubbleSort.h: interface for the CBubbleSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_BUBBLESORT_H__2A6E4581_4C19_4061_BD68_9FA2DD286EB5__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_BUBBLESORT_H__2A6E4581_4C19_4061_BD68_9FA2DD286EB5__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>14</code></td> 
   <td><code>class</code> <code> CBubbleSort : </code><code>public</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code></code><code>CBubbleSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>virtual</code> <code>~CBubbleSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>20</code></td> 
   <td><code></code><code>virtual</code> <code>void</code> <code>Sort(</code><code>int</code> <code>* arr,</code><code>const</code> <code> int</code> <code>size) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>24</code></td> 
   <td><code>#endif // !defined(AFX_BUBBLESORT_H__2A6E4581_4C19_4061_BD68_9FA2DD286EB5__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* InsertSort.h ~ 682B [ 下载][Link 3](149) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// InsertSort.h: interface for the CInsertSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_INSERTSORT_H__FF5699F7_8D6A_4709_93F1_97CDC299528A__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_INSERTSORT_H__FF5699F7_8D6A_4709_93F1_97CDC299528A__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>13</code></td> 
   <td><code>#include &lt;stdlib.h&gt; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>15</code></td> 
   <td><code>class</code> <code> CInsertSort : </code><code>public</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>CInsertSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>19</code></td> 
   <td><code></code><code>virtual</code> <code>~CInsertSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code></code><code>virtual</code> <code>void</code> <code>Sort (</code><code>int</code> <code>* arr,</code><code>const</code> <code> int</code> <code>size) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>22</code></td> 
   <td><code></code><code>void</code> <code>DirectInsertSort(</code><code>int</code> <code>*arr,</code><code>const</code> <code> int</code> <code>size); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>25</code></td> 
   <td><code>#endif // !defined(AFX_INSERTSORT_H__FF5699F7_8D6A_4709_93F1_97CDC299528A__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* InsertSort.cpp ~ 1KB [ 下载][Link 4](98) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// InsertSort.cpp: implementation of the CInsertSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "InsertSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CInsertSort::CInsertSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CInsertSort::~CInsertSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>29</code></td> 
   <td><code>void</code> <code> CInsertSort::Sort (</code><code>int</code> <code> * arr,</code><code>const</code> <code> int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>32</code></td> 
   <td><code></code><code>return</code> <code>; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>39</code></td> 
   <td><code></code><code>while</code> <code>(low&lt;= high) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>47</code></td> 
   <td><code></code><code>//high ָ��tmpӦ�����ǰһλ�ã�lowֵΪhigh+1 </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>57</code></td> 
   <td><code>void</code> <code> CInsertSort::DirectInsertSort(</code><code>int</code> <code> *arr,</code><code>int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>60</code></td> 
   <td><code></code><code>return</code> <code>; </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* Main.cpp ~ 1KB [ 下载][Link 5](149) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>#include &lt;iostream&gt; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>02</code></td> 
   <td><code>#include &lt;stdlib.h&gt; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>03</code></td> 
   <td><code>#include &lt;memory&gt; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>04</code></td> 
   <td><code>#include "BubbleSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "InsertSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#include "QuickSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>07</code></td> 
   <td><code>#include "SelectionSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>#include "ShellSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#define LENGTH 100 </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>using</code> <code> namespace</code> <code>std; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>// FILE *pFile ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code></code><code>//auto_ptr&lt;FILE&gt; apFile(pFile); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>//std::tr1::shared_ptr&lt;int&gt; sp(new int(0)); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>19</code></td> 
   <td><code></code><code>//tr1::shared_ptr&lt;FILE&gt; spFile ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>20</code></td> 
   <td><code>// pFile = fopen( ("2.txt"), ("wt")); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code>// if(!pFile) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>23</code></td> 
   <td><code>// std::cout&lt;&lt;"File open error!\n"&lt;&lt;std::endl; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>26</code></td> 
   <td><code></code><code>int</code> <code>arr[LENGTH]; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>28</code></td> 
   <td><code></code><code>for</code><code>(i=0;i&lt;LENGTH ;i++) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>34</code></td> 
   <td><code></code><code>CSort *pSort ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>35</code></td> 
   <td><code></code><code>pSort = </code> <code>new</code> <code>CShellSort ; </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>36</code></td> 
   <td><code></code><code>pSort-&gt;Sort(arr,LENGTH) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>37</code></td> 
   <td><code>// CInsertSort is ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>38</code></td> 
   <td><code>// is.DirectInsertSort(arr,LENGTH); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>40</code></td> 
   <td><code></code><code>delete</code> <code>pSort ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>41</code></td> 
   <td><code></code><code>for</code> <code>( i =0 ;i&lt;LENGTH;i++) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>45</code></td> 
   <td><code>// for( i=0;i&lt;LENGTH ;i++) </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>47</code></td> 
   <td><code>// fprintf(pFile, ("%d\n"),arr[i]); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>50</code></td> 
   <td><code>// fclose(pFile); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>52</code></td> 
   <td><code>// FILE *pFileReader ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>53</code></td> 
   <td><code>// pFileReader = fopen("1.txt","rt"); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>54</code></td> 
   <td><code>// if(!pFileReader) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>56</code></td> 
   <td><code>// std::cout&lt;&lt;"File open error!\n"&lt;&lt;std::endl; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>61</code></td> 
   <td><code>// for(i=0;i&lt;LENGTH;i++) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>63</code></td> 
   <td><code>// fscanf(pFileReader,"%d\n",&amp;n); </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>66</code></td> 
   <td><code>// //fclose(pFileReader); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>68</code></td> 
   <td><code></code><code>return</code> <code>0 ; </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* SelectionSort.cpp ~ 776B [ 下载][Link 6](148) ###

[view source][]

[print][] [?][Link 7]

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// SelectionSort.cpp: implementation of the CSelectionSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "SelectionSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CSelectionSort::CSelectionSort() </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CSelectionSort::~CSelectionSort() </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>22</code></td> 
   <td><code>void</code> <code> CSelectionSort::Sort (</code><code>int</code> <code> * arr,</code><code>const</code> <code> int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>25</code></td> 
   <td><code></code><code>return</code> <code>; </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* SelectionSort.h ~ 635B [ 下载][Link 8](151) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// SelectionSort.h: interface for the CSelectionSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_SELECTIONSORT_H__99AADAE2_AC7F_49BF_B382_388CD8A9E784__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_SELECTIONSORT_H__99AADAE2_AC7F_49BF_B382_388CD8A9E784__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>14</code></td> 
   <td><code>class</code> <code> CSelectionSort : </code><code>public</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code></code><code>CSelectionSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>virtual</code> <code>~CSelectionSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>23</code></td> 
   <td><code>#endif // !defined(AFX_SELECTIONSORT_H__99AADAE2_AC7F_49BF_B382_388CD8A9E784__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* Sort.cpp ~ 374B [ 下载][Link 9](141) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// Sort.cpp: implementation of the CSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CSort::CSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CSort::~CSort() </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* Sort.h ~ 530B [ 下载][Link 10](144) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// Sort.h: interface for the CSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_SORT_H__39C9279B_CB59_4081_B68B_C8D0459C1C1E__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_SORT_H__39C9279B_CB59_4081_B68B_C8D0459C1C1E__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>class</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>14</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>15</code></td> 
   <td><code></code><code>CSort(); </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code></code><code>virtual</code> <code>~CSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>virtual</code> <code>void</code> <code>Sort(</code><code>int</code> <code>* arr,</code><code>const</code> <code> int</code> <code>size) =0; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>22</code></td> 
   <td><code>#endif // !defined(AFX_SORT_H__39C9279B_CB59_4081_B68B_C8D0459C1C1E__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* ShellSort.h ~ 652B [ 下载][Link 11](145) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// ShellSort.h: interface for the CShellSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_SHELLSORT_H__77F1EA61_E5FA_42F9_96A0_A718CB82519E__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_SHELLSORT_H__77F1EA61_E5FA_42F9_96A0_A718CB82519E__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>14</code></td> 
   <td><code>class</code> <code> CShellSort : </code><code>public</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code></code><code>CShellSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>virtual</code> <code>~CShellSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code></code><code>void</code> <code>ShellPass (</code><code>int</code> <code>*arr ,</code><code>int</code> <code> size ,</code><code>int</code> <code>delta); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>24</code></td> 
   <td><code>#endif // !defined(AFX_SHELLSORT_H__77F1EA61_E5FA_42F9_96A0_A718CB82519E__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* QuickSort.h ~ 709B [ 下载][Link 12](129) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// QuickSort.h: interface for the CQuickSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#if !defined(AFX_QUICKSORT_H__55ABF9C0_0E66_431F_B3CE_5D63EF7BE1C6__INCLUDED_) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>06</code></td> 
   <td><code>#define AFX_QUICKSORT_H__55ABF9C0_0E66_431F_B3CE_5D63EF7BE1C6__INCLUDED_ </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>09</code></td> 
   <td><code>#pragma once </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>10</code></td> 
   <td><code>#endif // _MSC_VER &gt; 1000 </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>12</code></td> 
   <td><code>#include "Sort.h" </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>14</code></td> 
   <td><code>class</code> <code> CQuickSort : </code><code>public</code> <code> CSort </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>public</code><code>: </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>17</code></td> 
   <td><code></code><code>CQuickSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>18</code></td> 
   <td><code></code><code>virtual</code> <code>~CQuickSort(); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>20</code></td> 
   <td><code></code><code>virtual</code> <code>void</code> <code>Sort (</code><code>int</code> <code>* arr,</code><code>const</code> <code> int</code> <code>size) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code>private</code> <code> : </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>22</code></td> 
   <td><code></code><code>int</code> <code>Partition(</code><code>int</code> <code>* arr,</code><code>int</code> <code> low ,</code><code>int</code> <code>high) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>23</code></td> 
   <td><code></code><code>void</code> <code>QuickSort(</code><code>int</code> <code>*arr,</code><code>int</code> <code> low , </code><code>int</code> <code>high) ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>26</code></td> 
   <td><code>#endif // !defined(AFX_QUICKSORT_H__55ABF9C0_0E66_431F_B3CE_5D63EF7BE1C6__INCLUDED_)</code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* QuickSort.cpp ~ 1KB [ 下载][Link 13](123) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// QuickSort.cpp: implementation of the CQuickSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "QuickSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CQuickSort::CQuickSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CQuickSort::~CQuickSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>21</code></td> 
   <td><code>void</code> <code> CQuickSort::Sort (</code><code>int</code> <code> * arr,</code><code>const</code> <code> int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>24</code></td> 
   <td><code></code><code>return</code> <code>; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>25</code></td> 
   <td><code></code><code>QuickSort(arr,0,size-1); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>28</code></td> 
   <td><code>void</code> <code> CQuickSort::QuickSort(</code><code>int</code> <code> *arr,</code><code>int</code> <code>low , </code><code>int</code> <code>high) </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>33</code></td> 
   <td><code></code><code>int</code> <code>pivotloc = Partition(arr,low,high); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>34</code></td> 
   <td><code></code><code>QuickSort(arr,low,pivotloc-1); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>35</code></td> 
   <td><code></code><code>QuickSort(arr,pivotloc+1,high); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>38</code></td> 
   <td><code>int</code> <code> CQuickSort::Partition(</code><code>int</code> <code> * arr,</code><code>int</code> <code>low ,</code><code>int</code> <code>high) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>40</code></td> 
   <td><code></code><code>int</code> <code>pivot = arr[low]; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>41</code></td> 
   <td><code></code><code>while</code> <code>(low&lt;high) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>44</code></td> 
   <td><code></code><code>while</code><code>(low&lt;high &amp;&amp; arr[high]&gt;=pivot) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>47</code></td> 
   <td><code></code><code>while</code><code>(low&lt;high &amp;&amp; arr[low]&lt;=pivot) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>51</code></td> 
   <td><code></code><code>arr[low] = pivot; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>52</code></td> 
   <td><code></code><code>return</code> <code>low ; </code></td> 
  </tr> 
 </tbody> 
</table>

### *\[文件\]* ShellSort.cpp ~ 851B [ 下载][Link 14](99) ###

<table> 
 <tbody> 
  <tr> 
   <td><code>01</code></td> 
   <td><code>// ShellSort.cpp: implementation of the CShellSort class. </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>05</code></td> 
   <td><code>#include "ShellSort.h" </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>08</code></td> 
   <td><code>// Construction/Destruction </code> </td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>11</code></td> 
   <td><code>CShellSort::CShellSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>16</code></td> 
   <td><code>CShellSort::~CShellSort() </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>20</code></td> 
   <td><code>void</code> <code> CShellSort::Sort (</code><code>int</code> <code> * arr,</code><code>const</code> <code> int</code> <code>size) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>23</code></td> 
   <td><code></code><code>return</code> <code>; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>24</code></td> 
   <td><code></code><code>int</code> <code>increment = size ; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>26</code></td> 
   <td><code></code><code>increment = increment/3 +1; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>27</code></td> 
   <td><code></code><code>ShellPass(arr,size,increment); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>28</code></td> 
   <td><code></code><code>} </code> <code>while</code><code>(increment&gt;1); </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>30</code></td> 
   <td><code>void</code> <code> CShellSort::ShellPass(</code><code>int</code> <code> *arr ,</code><code>int</code> <code>size ,</code><code>int</code> <code>delta) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>32</code></td> 
   <td><code></code><code>for</code> <code>(</code><code>int</code> <code> i = delta;i&lt;size;i++) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>35</code></td> 
   <td><code></code><code>for</code> <code>(</code><code>int</code> <code> j = i-delta; j&gt;=0 &amp;&amp; tmp &lt; arr[j];j-=delta) </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>37</code></td> 
   <td><code></code><code>arr[j+delta] = arr[j]; </code></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td><code>39</code></td> 
   <td><code></code><code>arr[j+delta] = tmp ; </code></td> 
  </tr> 
 </tbody> 
</table>

[Link 1]: http://www.oschina.net/action/code/download?code=2795&id=4121
[Link 2]: http://www.oschina.net/action/code/download?code=2795&id=4122
[Link 3]: http://www.oschina.net/action/code/download?code=2795&id=4124
[Link 4]: http://www.oschina.net/action/code/download?code=2795&id=6952
[Link 5]: http://www.oschina.net/action/code/download?code=2795&id=4125
[Link 6]: http://www.oschina.net/action/code/download?code=2795&id=4128
[view source]: http://www.oschina.net/code/snippet_115193_2795#viewSource
[print]: http://www.oschina.net/code/snippet_115193_2795#printSource
[Link 7]: http://www.oschina.net/code/snippet_115193_2795#about
[Link 8]: http://www.oschina.net/action/code/download?code=2795&id=4129
[Link 9]: http://www.oschina.net/action/code/download?code=2795&id=4131
[Link 10]: http://www.oschina.net/action/code/download?code=2795&id=4132
[Link 11]: http://www.oschina.net/action/code/download?code=2795&id=4133
[Link 12]: http://www.oschina.net/action/code/download?code=2795&id=5333
[Link 13]: http://www.oschina.net/action/code/download?code=2795&id=5334
[Link 14]: http://www.oschina.net/action/code/download?code=2795&id=6953