实验-各种排序方法的比较.docVIP

实验一、 实验目的1．2．掌握3．。二、 实验要求1． 认真阅读和掌握本实验的程序。． 保存程序的运行结果，并结合程序进行分析。三、 实验内容 #include stdio.h #include stdlib.h #define TRUE 1 #define FALSE 0 #define N 10 int a[10] = { 9,27,45,87,17,23,25,92,8,75 }; typedef struct { int key; int info; }RecordNode; typedef struct Sort { int n; //记录个数 RecordNode *record; }SortObject; /*直接插入排序*/ void insertSort(SortObject *pvector) { int i, j; RecordNode temp; for (i = 1; i pvector-n; i++) { temp = pvector-record[i]; j = i - 1; while ((temp.key pvector-record[j].key) (j = 0)) { pvector-record[j + 1] = pvector-record[j]; j--; } if (j != (i - 1)) pvector-record[j + 1] = temp; } } /*二分法插入排序*/ void binSort(SortObject * pvector) { int i, j, left, mid, right; RecordNode temp; for (i = 1; i pvector-n; i++) { temp = pvector-record[i]; left = 0; right = i - 1; while (left = right) { mid = (left + right) / 2; if (temp.keypvector-record[mid].key) right = mid - 1; else left = mid + 1; } for (j = i - 1; j = left; j--) pvector-record[j + 1] = pvector-record[j]; if (left != i) pvector-record[left] = temp; } } struct Node; typedef struct Node ListNode; struct Node { int key; ListNode *next; }; typedef ListNode * LinkList; void listSort(LinkList * plist) { ListNode *now, *pre, *p, *q, *head; head = *plist; pre = head-next; if (pre == NULL) return; now = pre-next; if (now == NULL) return; while (now != NULL) { q = head; p = head-next; while (p != now p-key = now-key) { q = p; p = p-next; } if (p == now) { pre = pre-next; now = pre-next; continue; } pre-next = now-next; q-next = now; now-next = p; now = pre-next; } } /*Shell排序*/ void shellSort(SortObject * pvector, int d) { /* 按递增序进行Shell排序 */ int i, j, increment; RecordNode temp; for (increment = d; increment 0; increment /= 2) { for (i = increment; ipvec