qq_30207251的博客

//冒泡排序void Bubble_Sort(ElementType A[], int N){    for(P = N - 1; P >= 0; P--)    {        flag = 0;        for(i = 0; i < P; i++) //一趟冒泡        {            if(A[i] > A[i + 1])    ...

//最大堆的创建typedef struct HeapStruct *MaxHeap;struct HeapStruct{            ElenmentType Elements; //存放堆元素的数组            int Size; //堆当前大小            int Capacity; //堆得最大容量}MaxHeap Create(int Ma...

伪代码实现单链表逆序输出（1-k逆序）Ptr Reverse(Ptr head, int K){    cnt = 1;    new = head->next;    old = new->next;    while(cnt < K)    {        tmp = old->next;        old->next = new;    ...

//删除节点BinTree Delete(ElementType X, BinTree BST){    Position Tmp;    if(!BST) printf("要删除的元素未找到");    if(X < BST->Data)        BST->Left = Delete(X, BST->Left);//左子树递归删除    else if...

//二叉树的遍历之递归实现（中序为例）void InOrderTravelsal(BinTree BT){    if(BT)    {        InOrderTravelsal(BT->Left);        printf("%d", BT->Data);        InOrdweTravelsal(BT->Right);    }}//二叉树的...

//顺序查找（建立哨兵）int SequentialSearch(StaticTable *Tbl, ElememtType K){    int i;    Tbl->Element[0] = K; //建立哨兵    for( i = Tbl->Length, Tbl-Element[i] != K, i--);    return i;}...

//顺序存储typedef struct{    ElementType Data[MaxSize];    int rear;    int front;}Queue;//循环队列入队出队“＋1取余法”void AddQ(Queue *Q, ElementTyoe Data){    if ((Q->rear + 1) % MaxSize == Q->front){...

//顺序存储#definr MaxSize 最大个数typedef struct {            ElenmentType Data[MaxSize];            int Top;}Stack;//链式存储typedef struct Node{            ElementType Data;            struct Node *Next...

最大子列和问题

转载自https://blog.csdn.net/lzw66666/article/details/78934893什么是哈夫曼树？让我们先举一个例子。判定树：        在很多问题的处理过程中，需要进行大量的条件判断，这些判断结构的设计直接影响着程序的执行效率。例如，编制一个程序，将百分制转换成五个等级输出。大家可能认为这个程序很简单，并且很快就可以用下列形式编写出来： [cpp] view...