基本的排序方法代码,C代码库,德仔网

代码语言
代码分类
【C】基本的排序方法
作者:Dezai.CN / 发布于2011/8/1/ 569
给定一组整数,分别用直接插入排序、冒泡排序方法进行排序，输出排序后的结果
<div><span style="color: rgb(0,0,0)">#include</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">iostream.h</span><span style="color: rgb(0,0,0)">></span><span style="color: rgb(0,0,0)">
</span><span style="color: rgb(0,0,255)">#define</span><span style="color: rgb(0,0,0)"> MAXSIZE 20 </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">假设文件长度 ，即待排序记录数目</span><span style="color: rgb(0,0,0)">
typedef </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> KeyType; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)"> 假设的关键字类型</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">typedef </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> InfoType;
typedef </span><span style="color: rgb(0,0,255)">struct</span><span style="color: rgb(0,0,0)"> { </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">记录定义</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">
 KeyType key; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">关键字型</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> InfoType otherinfo; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">其他数据项，InfoType依赖于具体应用</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">}RedType; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">记录类型</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">typedef </span><span style="color: rgb(0,0,255)">struct</span><span style="color: rgb(0,0,0)"> { </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">顺序表定义</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">
 RedType r[MAXSIZE</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">]; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">r[0]闲置或用来做小兵</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> length; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">顺序表长度</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> 
}SqList; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">顺序表类型</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">
</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> input(SqList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">l)
{
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">请输入各元素</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">l.length;i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">)
 {
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">l.r[i].key;
 }
}
</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Insertsort(SqList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L){ </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">对顺序表进行直接插入排序</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">

 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i,j;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">2</span><span style="color: rgb(0,0,0)">;i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">L.length;i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">外循环</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(L.r[i].key</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.r[i</span><span style="color: rgb(0,0,0)">-</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">].key) { </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">将L.r[i]插入有序子表</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> 
 L.r[</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[i]; 
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(j</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">i</span><span style="color: rgb(0,0,0)">-</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;L.r[</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">].key</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.r[j].key;j</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">) </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">内循环</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> L.r[j</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[j]; </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">记录后移</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> L.r[j</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">];

 } </span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">end if</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">
}</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">Insertsort</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,255)">void</span><span style="color: rgb(0,0,0)"> Bubblesord(SqList </span><span style="color: rgb(0,0,0)">&</span><span style="color: rgb(0,0,0)">L)
{
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i,j;
 </span><span style="color: rgb(0,0,255)">bool</span><span style="color: rgb(0,0,0)"> tag</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">( i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;(tag</span><span style="color: rgb(0,0,0)">==</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">)</span><span style="color: rgb(0,0,0)">&&</span><span style="color: rgb(0,0,0)">(i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">L.length);</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">i)
 {
 tag</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(j</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.length</span><span style="color: rgb(0,0,0)">-</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;j</span><span style="color: rgb(0,0,0)">>=</span><span style="color: rgb(0,0,0)">i;</span><span style="color: rgb(0,0,0)">--</span><span style="color: rgb(0,0,0)">j)
 </span><span style="color: rgb(0,0,255)">if</span><span style="color: rgb(0,0,0)">(L.r[j</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">].key</span><span style="color: rgb(0,0,0)"><</span><span style="color: rgb(0,0,0)">L.r[j].key)
 {
 L.r[</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[j</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">];L.r[j</span><span style="color: rgb(0,0,0)">+</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[j];L.r[j]</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">L.r[</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">];tag</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">;
 }</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">end if</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)"> }</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">end for</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,0)">}</span><span style="color: rgb(0,128,0)">//</span><span style="color: rgb(0,128,0)">Bubblesord</span><span style="color: rgb(0,128,0)">
</span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> main()
{
 SqList L;
 </span><span style="color: rgb(0,0,255)">int</span><span style="color: rgb(0,0,0)"> i,m;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">请输入元素个数:</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 cin</span><span style="color: rgb(0,0,0)">>></span><span style="color: rgb(0,0,0)">m;
 L.length</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(0,0,0)">m;
 input(L);
 </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 显示该顺序表 </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">\n该顺序表为</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">L.length;i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">)
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.r[i].key</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 进行直接插入排序 </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 Insertsort(L);
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">直接插入法排序</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">L.length;i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">)
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.r[i].key</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,128,0)">/*</span><span style="color: rgb(0,128,0)"> 进行冒泡排序 </span><span style="color: rgb(0,128,0)">*/</span><span style="color: rgb(0,0,0)">
 Bubblesord(L);
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)">进行冒泡排序</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,0,255)">for</span><span style="color: rgb(0,0,0)">(i</span><span style="color: rgb(0,0,0)">=</span><span style="color: rgb(128,0,128)">1</span><span style="color: rgb(0,0,0)">;i</span><span style="color: rgb(0,0,0)"><=</span><span style="color: rgb(0,0,0)">L.length;i</span><span style="color: rgb(0,0,0)">++</span><span style="color: rgb(0,0,0)">)
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">L.r[i].key</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(128,0,0)"> </span><span style="color: rgb(128,0,0)">"</span><span style="color: rgb(0,0,0)">;
 cout</span><span style="color: rgb(0,0,0)"><<</span><span style="color: rgb(0,0,0)">endl;
 </span><span style="color: rgb(0,0,255)">return</span><span style="color: rgb(0,0,0)"> </span><span style="color: rgb(128,0,128)">0</span><span style="color: rgb(0,0,0)">;
}
</span></div>
试试其它关键字
　排序　
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)