声明待排序元素类型
1
/*--------------------------
2
typedef.h
3
方便修改待排序元素类型
4
-------------------------------------*/
5
#ifndef TYPEDEF_H
6
#define TYPEDEF_H
7![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
8
typedef int T;
9![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
10
#endif
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
2
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
3
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
4
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
5
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
6
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
7
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
8
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
9
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
10
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
插入排序:
1
/*---------------------------------------------------------------------------------------
2
Insertion_sort.h
3
直接插入排序
4
对以数组形式给出的元素排序
5
时间复杂度为(逆序数)N(N-1)/4 = O(N^2),并且在最坏情形下达到这个值
6
最好情形下运行N次,最坏情形下运行2+3+…+N
7
------------------------------------------------------------------------------------------------*/
8![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
9
#ifndef INSERTION_SORT_H
10
#define INSERTION_SORT_H
11![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
12
#include "typedef.h"
13
//直接插入排序
14
void Insertion_sort(T *a, int n)
15
{
16
for(int i = 1; i != n; ++i)
17
{
18
T temp = a[i];
19
int j = i - 1;
20
for(; j >= 0 && temp < a[j]; --j )
21
a[j + 1] = a[j];
22
a[j + 1] = temp;
23
}
24
}
25![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
26
#endif
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
2
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
3
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
4
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
5
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
6
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
7
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
8
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
9
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
10
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
11
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
12
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
13
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
14
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
15
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
16
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
17
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
18
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
19
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
20
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
21
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
22
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
23
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
24
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
25
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
26
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
直接选择排序:
1
/*----------------------------------------------
2
DirectSelection_sort.h
3
直接选择排序
4
时间复杂度O(N^2)
5
--------------------------------------------------------*/
6
#ifndef DIRECTSELECTION_SORT_H
7
#define DIRECTSELECTION_SORT_H
8![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
9
#include "typedef.h"
10
#include "swap.h"
11![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
12
//直接选择法排序
13
void DirectSelection_sort(T*a, int n)
14
{
15
for(int i = 0; i != n; ++i)
16
{
17
int k = i;
18
for(int j = i; j != n; ++j)
19
if(a[j] < a[k]) k = j;
20
swap(a[k],a[i]);
21
}
22
}
23![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
24
#endif
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
2
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
3
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
4
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
5
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
6
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
7
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
8
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
9
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
10
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
11
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
12
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
13
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
14
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
15
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
16
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
17
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
18
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
19
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
20
![](http://www.cppblog.com/Images/OutliningIndicators/InBlock.gif)
21
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
22
![](http://www.cppblog.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
23
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)
24
![](http://www.cppblog.com/Images/OutliningIndicators/None.gif)