数据结构实训（Data structure training）.docVIP

数据结构实训（Data structure training） # includes stdio.h # includes malloc.h # includes conio.h # define maxsize 10 extern int b3 = 0, y3 = 0; extern int b = 0, y4 = 0; typedef int keytype; typedef struct list _ info { keytype key; } elemtype; / / 直接插入排序 void insertsort (elemtype [], int n) { int i, j; int b = 0, yl = 0; for (i = 2; the = n; i + +) { to [0] = a [i]. j = i - 1. yl + +; while (a [0] to [j].key.key) { [j + 1] = a [j]. j = j - 1; b1 + +; yl + +; } yl + +; [j + 1] = a [0]. } for (i = 1, the = n; i + +) printf (% d, []); printf (\ n); printf (比较次数b1 =% d, 移动次数y1 =% d \ n, b1, yl); } / / 冒泡排序 void bubblesort3 (elemtype [], int n) { int i, j, last, flag, m, s; int b = 0, y2 = 0; last = n - 1. for (i = n; i 1; -) { flag = 0; m = last; for (j = 1; j = m; j + +) if (a [j].key [j + 1].key) { s = [j].key; [j].key = [j + 1].key; [j + 1].key = temp; flag = 1; last = j; b + +. y2 + +; } if (flag = = 0) break; } for (i = 1, the = n; i + +) printf (% d, []); printf (\ n); printf (比较次数b2 =% d, 移动次数y2 =% d \ n, b2, y2). } / / 快速排序 void quicksort (elemtype [], int from, int right) { elemtype temp. int i, j; i = left (j = right; s = a [i]. while (i j) { doc + +. while (i j temp.key = [j].key) { j -. doc + +. } in [the] = a [j].key.key; y3 + +; while (i j [i].key = temp.key) { the + +; doc + +. } [j].key = a [i].key; y3 + +; } [i] = temp; y3 + +; if (left - i - 1) quicksort (a, left, - 1); doc + +. if (i + 1) (right) quicksort (a, + 1, right). doc + +. } / / 堆排序 void heapsift (elemtype [], int s, int m) { elemtype temp. int j; s = [s]. j = 2 * d; y4 + +; while (j = m) { b4 + +; if (j m a [j].key [j + 1].key) { j + +. b4 + +; } if (temp.key [j].key) { b4 + +; [d] = a [j]; s = j; j = j * 2); y4 + +; } else j = m + 1. } [d] = temp; y4 + +; } void heapsort (elemtype [], int length) { int i, j; elemtype temp. for (i = length / 2; i = 1; -) heapsift (the length). for (j = length; j = 2; j -) { s = [1]. in [1] = a [j]. a [j] = temp; heapsift (a, 1, - 1); y