C语言基本排序算法之插入排序与直接选择排序实现方法

/*--------------------------typedef.h方便修改待排序元素类型-------------------------------------*/#ifndef TYPEDEF_H#define TYPEDEF_Htypedef int T;#endif

/*---------------------------------------------------------------------------------------Insertion_sort.h直接插入排序对以数组形式给出的元素排序时间复杂度为(逆序数)N(N-1)/4 = O(N^2),并且在最坏情形下达到这个值最好情形下运行N次，最坏情形下运行2+3+…+N------------------------------------------------------------------------------------------------*/#ifndef INSERTION_SORT_H#define INSERTION_SORT_H#include "typedef.h"//直接插入排序 void Insertion_sort(T *a, int n){  for(int i = 1; i != n; ++i)  {    T temp = a[i];    int j = i - 1;    for(; j >= 0 && temp < a[j]; --j )      a[j + 1] = a[j];    a[j + 1] = temp;  }}#endif

/*----------------------------------------------DirectSelection_sort.h直接选择排序时间复杂度O(N^2)--------------------------------------------------------*/#ifndef DIRECTSELECTION_SORT_H#define DIRECTSELECTION_SORT_H#include "typedef.h"#include "swap.h"//直接选择法排序void DirectSelection_sort(T*a, int n){  for(int i = 0; i != n; ++i)  {    int k = i;    for(int j = i; j != n; ++j)      if(a[j] < a[k]) k = j;    swap(a[k],a[i]);  }}#endif