计算机内部排序时间复杂度的比较.docVIP

#includestdio.h #includestdlib.h #includemath.h #define MAXSIZE 50 typedef int KeyType; #define MAXNUM 100 typedef struct{ KeyType key; }RedType; RedType R[MAXNUM]; typedef struct{ RedType r[MAXSIZE + 1] int length; }Sqlist; Sqlist L, L0, L1, L2, L3, L4, L5, L6, L7; typedef Sqlist HeadType; #define RADIX 10 #define MAX 8 #define MAX_SPACE 10000 typedef int KeysType; typedef struct { KeysType keys[MAX]; int next; }SLCell; typedef struct { SLCell rl[MAX_SPACE]; int keynum; int recnum; }SLList; typedef int ArrType[RADIX]; int compare[8]; int change[8]; void shuRu(Sqlist L){ int i = 1, n; printf(输入的数据个数 : \n); scanf(%d, n); printf(依次的输入各个数据值\n); L.length = n; for (; i = L.length; i++){ scanf(%d, L.r[i]); } } void shuChu(Sqlist L){ int i = 1; printf(该顺序存储中的数据元素为：); for (; iL.length; i++){ printf(%d , L.r[i]); } printf(%d\n\n, L.r[i]); } == int SelectMinKey(Sqlist L, int i){ int k; compare[0] += L.length - i; for (k = i; i = L.length; i++){ compare[0]++; compare[0]++; if (L.r[i].keyL.r[k].key){ k = i; change[0]++; } } return k; } void SelectSort(Sqlist L){ int i, j, temp; for (i = 1; iL.length; ++i){ compare[0]++; j = SelectMinKey(L, i); compare[0]++; if (i != j){ temp = L.r[i].key; L.r[i].key = L.r[j].key; L.r[j].key = temp; change[0] += 3; } } } void inserSort(Sqlist L){ int j; for (int i = 2; i = L.length; ++i) { compare[1]++; compare[1]++; if (L.r[i].keyL.r[i - 1].key){ L.r[0] = L.r[i]; L.r[i] = L.r[i - 1]; change[1] += 2; for (j = i - 2; j0; j--){ compare[1]++; compare[1]++; if (L.r[0].key = L.r[j].key) break; L.r[j + 1] = L.r[j]; change[1]++; } L.r[j + 1] = L.r[0]; change[1]++; } } } void BubbleSort(Sqlist L){ int i, j, temp; for (i = 1; i = L.length; i++){ compare[2]++; for (j = 1; j = L.length - i; j++){ compare[2]++; compare[2]++; if (L.r[j].keyL.r[j + 1].key){ temp = L.r[j].key; L.r[j].key = L.r[j + 1].key; L.r[j