数据结构与算法，c语言实现

代码：数据结构与算法代码，c语言实现-算法与数据结构文档类资源-CSDN下载

部分代码：

#ifndef __BINQUEUE_H__
#define __BINQUEUE_H__
#define CONFIG
#include "../Config.h"
#define MaxTrees (16)
#define Infinity (65535)
#define Capacity (65535)

typedef struct bin_node
{
    ElementType Element;
    Position LeftChild;
    Position NextSibling;
} BinNode;
typedef BinNode *BinTree;
typedef BinNode *Position;

typedef struct collection
{
    int CurrentSize;
    BinTree TheTrees[MaxTrees];
} Collection;
typedef Collection *BinQueue;

BinQueue Initialize(void);
int IsEmpty(BinQueue H);
BinQueue Merge(BinQueue H1, BinQueue H2);
BinQueue Insert(ElementType X, BinQueue H);
ElementType DeleteMin(BinQueue H);

#endif

//删除并返回二项队列中最小元素
ElementType DeleteMin(BinQueue H)
{
    int i, j;
    int MinTree;
    BinQueue DeletedQueue;
    Position DeletedTree, OldRoot;
    ElementType MinItem;

    if (IsEmpty(H))
    {
        Error("Empty binomial queue");
        return -Infinity;
    }

    MinItem = Infinity;
    for (i = 0; i < MaxTrees; i++)
    {
        if (H->TheTrees[i] && H->TheTrees[i]->Element < MinItem)
        {
            MinItem = H->TheTrees[i]->Element;
            MinTree = i;
        }
    }

    DeletedTree = H->TheTrees[MinTree];
    OldRoot = DeletedTree;
    DeletedTree = DeletedTree->LeftChild;
    free(OldRoot);

    DeletedQueue = Initialize();
    DeletedQueue->CurrentSize = (1 << MinTree) - 1;
    for (j = MinTree - 1; j >= 0; j--)
    {
        DeletedQueue->TheTrees[j] = DeletedTree;
        DeletedTree = DeletedTree->NextSibling;
        DeletedQueue->TheTrees[j]->NextSibling = NULL;
    }

    H->TheTrees[MinTree] = NULL;
    H->CurrentSize -= DeletedQueue->CurrentSize + 1;

    Merge(H, DeletedQueue);
    return MinItem;
}

//合并部分
void Merge(ElementType A[], ElementType TmpArray[],
           int Lpos, int Rpos, int RightEnd)
{
    int i, LeftEnd, NumElements, TmpPos;

    LeftEnd = Rpos - 1;
    TmpPos = Lpos;
    NumElements = RightEnd - Lpos + 1;

    
    while (Lpos <= LeftEnd && Rpos <= RightEnd)
        if (A[Lpos] <= A[Rpos])
            TmpArray[TmpPos++] = A[Lpos++];
        else
            TmpArray[TmpPos++] = A[Rpos++];

    while (Lpos <= LeftEnd) 
        TmpArray[TmpPos++] = A[Lpos++];
    while (Lpos <= LeftEnd) 
        TmpArray[TmpPos++] = A[Rpos++];

    
    for (i = 0; i < NumElements; i++, RightEnd--)
        A[RightEnd] = TmpArray[RightEnd];
}
//递归部分
void MSort(ElementType A[], ElementType TmpArray[],
           int Left, int Right)
{
    int Center;

    if (Left < Right)
    {
        Center = (Left + Right) / 2;
        MSort(A, TmpArray, Left, Center);
        MSort(A, TmpArray, Center + 1, Right);
        Merge(A, TmpArray, Left, Center + 1, Right);
    }
}
//归并排序
void MergeSort(ElementType A[], int N)
{
    ElementType *TmpArray;

    if ((TmpArray = (ElementType *)malloc(N * sizeof(ElementType))) == NULL)
        FatalError("Out of space!!!");
    MSort(A, TmpArray, 0, N - 1);
    free(TmpArray);
}