堆排序(6)

最新推荐文章于 2020-06-03 14:51:36 发布

byd yes

最新推荐文章于 2020-06-03 14:51:36 发布

阅读量450

点赞数

分类专栏： Introduction-to-Algorithms 文章标签：算法导论

本文链接：https://blog.csdn.net/dai_xiangjun/article/details/40054307

版权

Introduction-to-Algorithms 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

1.理论参见:http://blog.csdn.net/genios/article/details/8157031

2.c代码:

/*************************************************************************
	> File Name: headSort.c
	> Author: NULL
	> Mail: 574889524@qq.com
	> Created Time: Mon 13 Oct 2014 08:46:11 PM CST
 ************************************************************************/

#include<stdio.h>
#define ARRSIZE 10
/*************************************************/
void ExChangeInt(int *a,int *b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
}

int Leaf(int i)
{
    return 2*i+1;
}

int Right(int i)
{
    return 2*i+2;
}
void PrintArr(int A[],int iLarg)
{
    int i;
    for(i = 0; i < iLarg;++i)
        printf("%d ",A[i]);
    printf("\n");

}
/***********************************************/
static int giHeapSize = ARRSIZE - 1;;
void MaxHeapIfy(int *A,int i)
{
    int iLargest;
    int iL = Leaf(i);
    int iR = Right(i);
    
    if((iL<=giHeapSize) && (A[iL] > A[i]))
        iLargest = iL;
    else
        iLargest = i;

    if((iR <=giHeapSize) && (A[iR] > A[iLargest]))
        iLargest = iR;

    if(iLargest != i){
        ExChangeInt(&A[i],&A[iLargest]);
        MaxHeapIfy(A,iLargest);
    }
}

void BuildMaxHeap(int *A)
{
    int i;
    for(i =(ARRSIZE-1)/2;i>=0;--i)
        MaxHeapIfy(A,i);
}

void HeapSort(int *A)
{
    int i,iSize = ARRSIZE-1;
    BuildMaxHeap(A);
    for(i = iSize;i>=1;--i){
        ExChangeInt(&A[0],&A[i]);
        giHeapSize--;
        MaxHeapIfy(A,0);
    }
}


/***********************************************/

int main()
{
    int i,A[ARRSIZE] = {4,1,2,3,16,9,10,14,8,7};
    
    HeapSort(A);
    PrintArr(A,ARRSIZE); 
    
    return 0;
}