BobDay的博客

这个程序有个大bug，就是稍大一点的文件不能先压缩在解压，只能压缩后退出程序再解压，不知道是不是内存问题#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>/*用Huffman算法写出一个程序实现文件的压缩(和解压缩)*///怎么输入数据，这里牵...

#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>/*用Huffman算法写出一个程序实现文件的压缩(和解压缩)*///怎么输入数据，这里牵扯到字母转ASCII二进制//输出二进制//大体流程//将读取的数据放进一个数组//这个数组的元...

`#include <stdio.h>#define MAX 16int pre[MAX + 1]; //寻找父节点void Initialize(int *S);void InitializeH(int *S);void InitializeS(int *S);void SetUnion(int *S, int Root1, int Root2);void SetUn...

插入排序#include <stdio.h>typedef int ElementType;void InsertionSort(ElementType A[], int N);void InsertionSort(ElementType A[], int N){ int i, P; ElementType tmp; for (P = 1; P ...

#include <stdio.h>#include <stdlib.h>typedef int ElementType;void Merge(ElementType A[], ElementType TmpArray[], int Lpos, int Rpos, int RightEnd);void MergeSort(ElementTyp...

教材中二项队列的例程：#include <stdio.h>#include <stdlib.h>#include <limits.h>#define MaxTrees 10#define Capacity 10typedef struct BinNode *BinTree;typedef struct BinNode *Position;typ...

binHeap.h:#ifndef _BinHeap_Hstruct HeapStruct;typedef struct HeapStruct *PriorityQueue;typedef int ElementType;PriorityQueue Initialize(int MaxElements);void Destroy(PriorityQueue H);void Ma...

PriorityQueue UpFilter(int P, PriorityQueue H){ /*從P處開始上濾*/ /*如果父節點大於子節點*/ /*那麼父節點下移*/ int i; ElementType tmp; tmp = H->Elements[P]; for (i = P; H->Elements[i / 2] ...

/*该程序利用散列的方式将两个稀疏多项式相乘后合并同类项*//*散列表的建立使用了分离链接法*/#include <stdio.h>#include <stdlib.h>#define HASHMODULUS 11 //散列函數的模數/*多项式的例程*/typedef struct Node *polynomial;typedef struct Node *...

//改程序是执行双旋转的函数，其效率超过执行两个单旋转#include <stdio.h>#include <stdlib.h>#include "AvlT.h"static Position doubleRotationWithLeft(Position K3);static Position doubleRotationWithLeft(Position K3...

AvlT.h#ifndef _AvlT_Hstruct AvlNode;typedef struct AvlNode *Position;typedef struct AvlNode *AvlTree;typedef int ElementType;AvlTree MakeEmpty(AvlTree T);Position Find(ElementType X, AvlTree ...

CursorBSt.h//该程序是二分查找树的链表游标的实现方式#ifndef _CursorBST_Htypedef int PtrToNode;typedef PtrToNode SearchTree;typedef PtrToNode Position;void InitializeCursorSpace(void);SearchTree MakeEmpty(Search...

//该程序仅用一个数组而实现两个栈的例程。//除非数组的每一个单元都被使用//否则你的栈例程不能有溢出声明#include <stdio.h>#include <stdlib.h>#define MinStackSize (5)typedef struct Node *dbstack; //双栈dbstack CreatStack(int Ma...

大佬的算法 List ReverseList( List L ){ Position CurrentPos, NextPos, PreviousPos; PreviousPos = NULL; CurrentPos= L; NextPos= L->Next; while( NextPos != NULL ) { Curren...

我的算法让我想到了“寄生虫”（难道是因为前不久看了这部剧？）#include <stdio.h>#include <stdlib.h>#define MAX 100typedef struct Node *PtrToNode;typedef PtrToNode Header;typedef PtrToNode FirstNode;typedef PtrTo...

#include <stdio.h>#include <stdio.h>typedef struct Node *PtrToNode;typedef PtrToNode Header;typedef PtrToNode FirstNode;typedef PtrToNode Polynomial;void MultPolynomial(const Polyno...

#include <stdio.h>#include <stdlib.h>#include <time.h>int RandInt(int a, int b);int main(){ int N; int i; int ii; int a; int b; int duplicates = 0; //判...

试对图3-23所示的“Emai地址验证”程序儆出修改,新的合法性验证要求,在E-mail地址宇符串中,符号@前、符号@和.之间、符号.之后,至少存在一个字母。满足这种要求的Emal地址,才认为是合法的。#include <stdio.h>#define FAlSE 0#define TRUE 1int main(){ char nextChar; ch...

一开始我的代码是这样写的思路就是：如果a>b,则b一路加到a, i=a-b,然后a=a-i=b;a<b同理#include <stdio.h>void Swap(int *, int *);int main(){ int x; int y; printf("Input the value of x: "); scanf("...