堆排序和快速排序

点击(此处)折叠或打开

1. #include<stdio.h>
   
2. typedef struct
   
3. {
   
4.   int key;
   
5. }keytype;
   
6. typedef struct
   
7. { keytype r[100];
   
8.    int length;
   
9. }sqlist;
   
10. /*创建顺序表*/
    
11. void creat(sqlist *l)
    
12. {
    
13.  int i,key;
    
14.  printf("please intput it's length:");
    
15.  scanf("%d",&l->length);
    
16.  printf("\n\nplease intput %d data\n",l->length);
    
17.  for(i=1;i<=l->length;i++)
    
18.  {
    
19.   scanf("%d",&key);
    
20.   l->r[i].key=key;
    
21.  }
    
22. }
    
23. 
    
24. /*显示顺序表*/
    
25. void display(sqlist *l)
    
26. { int i;
    
27.    for(i=1;i<=l->length;i++)
    
28.      printf("%-4.2d",i);
    
29.    printf("\n");
    
30.    for(i=1;i<=2*l->length;i++)
    
31.      printf("--");
    
32.    printf("\n");
    
33.    for(i=1;i<=l->length;i++)
    
34.      printf("%-4.2d",l->r[i].key);
    
35. }
    
36. /*调整h->r[s]的关键字，使h->r[s]成为一个大顶堆*/
    
37. void heapadjust(sqlist *h,int s,int m)
    
38. { keytype rc;
    
39.     int j;
    
40.     rc=h->r[s];
    
41.     for(j=2*s;j<=m;j*=2)
    
42.     { if(j<m&&h->r[j].key<h->r[j+1].key)
    
43.          ++j;
    
44.        if(rc.key>=h->r[j].key) break;
    
45.        h->r[s]=h->r[j];
    
46.        s=j;
    
47.     }
    
48.     h->r[s]=rc;
    
49. }
    
50. /*对顺序表h进行堆排序*/
    
51. void heapsort(sqlist *h)
    
52. { keytype rc;int i;
    
53.    for(i=h->length/2;i>0;--i)
    
54.      heapadjust(h,i,h->length);
    
55.    for(i=h->length;i>1;--i)
    
56.    { rc=h->r[1];
    
57.       h->r[1]=h->r[i];
    
58.       h->r[i]=rc;
    
59.       heapadjust(h,1,i-1);
    
60.    }
    
61. }
    
62. /*主函数*/
    
63. void main()
    
64. { sqlist t;int i;
    
65.    creat(&t);
    
66.    printf("\n\n");
    
67.    heapsort(&t);
    
68.    printf("\n");
    
69.    printf("\nheapsort means:\n");
    
70.    display(&t);
    
71.    getch();
    
72. }

点击(此处)折叠或打开

1. #include<stdio.h>
   
2. typedef struct
   
3. {
   
4.   int key;
   
5. }keytype;
   
6. typedef struct
   
7. { keytype r[100];
   
8.    int length;
   
9. }sqlist;
   
10. /*创建顺序表*/
    
11. void creat(sqlist *l)
    
12. {
    
13.  int i,key;
    
14.  printf("please intput it's length:");
    
15.  scanf("%d",&l->length);
    
16.  printf("\n\nplease intput %d data\n",l->length);
    
17.  for(i=1;i<=l->length;i++)
    
18.  {
    
19.   scanf("%d",&key);
    
20.   l->r[i].key=key;
    
21.  }
    
22. }
    
23. /*交换顺序表中子表r[low...high]的记录，使枢轴记录到位，并返回其所在的位置*/
    
24. int partion(sqlist *l,int low,int high)
    
25. { int pivotkey;
    
26.     l->r[0]=l->r[low];
    
27.     pivotkey=l->r[low].key;
    
28.     while(low<high)
    
29.     { while(low<high&&l->r[high].key>=pivotkey)
    
30.       --high;
    
31.       l->r[low]=l->r[high];
    
32.       while(low<high&&l->r[low].key<=pivotkey)
    
33.       ++low;
    
34.       l->r[high]=l->r[low];
    
35.     }
    
36.     l->r[low]=l->r[0];
    
37.     return low;
    
38. }
    
39. /*快速排序*/
    
40. void Qsort(sqlist *l,int low,int high)
    
41. { int pivotloc;
    
42.   if(low<high)
    
43.    { pivotloc=partion(l,low,high);
    
44.       Qsort(l,low,pivotloc-1);
    
45.       Qsort(l,pivotloc+1,high);
    
46.    }
    
47. }
    
48. /*显示顺序表*/
    
49. void display(sqlist *l)
    
50. { int i;
    
51.    for(i=1;i<=l->length;i++)
    
52.      printf("%-4.2d",i);
    
53.    printf("\n");
    
54.    for(i=1;i<=2*l->length;i++)
    
55.      printf("--");
    
56.    printf("\n");
    
57.    for(i=1;i<=l->length;i++)
    
58.      printf("%-4.2d",l->r[i].key);
    
59. }
    
60. 
    
61. /*主函数*/
    
62. void main()
    
63. { sqlist t;int i;
    
64.    creat(&t);
    
65.    Qsort(&t,1,t.length);
    
66.    printf("\n\n");
    
67.    printf("quicksort means:\n");
    
68.    display(&t);
    
69.    getch();
    
70. }