Arvon

源代码如下：#include #include typedef struct node *link;struct node{ int item ; link next;}; typedef struct QUEUEnode* queue;struct QUEUEnode{ link item ; queue next;};static queue head , ta

源代码如下：#include #include typedef struct Item *node;struct Item{ int data; char c;};static Item *pq;static int N ;void swap(Item &a,Item &b){struct Item t = a;a = b;b = t;}void PQinit(i

源代码如下#include #include typedef struct Item *node;struct Item{ int data; char c;};static Item *pq;static int N ;void swap(Item &a,Item &b){struct Item t = a;a = b;b = t;}//自底向上堆化 完全二叉树

源代码如下：#include #include typedef struct pq* PQ;typedef struct PQnode* PQlink;struct Item{int data;char c;};struct PQnode{Item key;PQlink prev,next;};struct pq{PQlink head,tail;};PQ PQinit

源代码如下：/*一棵二次幂堆是一棵左有序的堆，由右子树为空左子树为完全二叉树构成的根组成二项队列：是二次幂堆的一个集合。 其中不存在相等大小的堆。其结构由队列节点数目确定 对应整数的二进制表示。 */ #include #include #define maxBQsize 40typedef struct PQnode* PQlink;typedef struc

源代码如下：#include #include typedef struct QUEUEnode* link;struct QUEUEnode{ int item ; link next; link head , tail;};link NEW(int item, link next){ link x = (link) malloc(sizeof *x); x->ite

原代码如下：#include #include //#define Key inttypedef int Key;struct Item{ Key key; char c;};typedef struct STnode* link;struct STnode{ Item item ; link l,r; int N;};static link head , z

红黑树是2-3-4树的一个变体 #include #include //#define Key int#define hl h->l#define hr h->r#define hlr h->l->r#define hll h->l->l#define hrr h->r->r#define hrl h->r->ltypedef char Key;struct Ite

源代码如下：这里的Key 不当为关键字对待， 而是把Item.c作为关键字对待#include #include //#define Key inttypedef int Key;struct Item{ Key key; char c;};typedef struct STnode* link;struct STnode{ Item item ; li

源代码如下：#include #include //#define Key int#define hl h->l#define hr h->r#define hlr h->l->r#define hll h->l->l#define hrr h->r->r#define hrl h->r->ltypedef int Key;struct Item{ Key key; c

源代码如下:#include #include #define lgNmax 5typedef char Key;struct Item{Key key;};typedef struct STnode* link;struct STnode{ Item item ; link *next; //多个链接域组成的数组 int sz ; // 该节点的链接数

一下是源代码package com.arvon.json1.bean;import java.util.ArrayList;import java.util.List;/** * 森林生成的算法 *@author Huangwen *@time 2017-1-23 */public class TreeNode { private int id ; priv

希尔排序源代码如下：#include //希尔排序 void shellSort(int a[],int l, int r){ //一次排序同一步长所组成的集合 如a[0],a[5],a[10]... int i,j,h; for(h=1;h<=(r-1)/9;h=3*h+1); //设置步长为1,4,13,40,121,...序列 for( ; h>0;h/=3) f

源代码如下：#includeusing namespace std;#define MAX_VERTEX_NUM 20#define infinity 9typedef int QElemType; typedef int EdgeData;typedef char VertexData;typedef struct { VertexData verlist[M

源代码如下：#include #include #define hash(v,M) (v % M)typedef char Key;struct Item{ Key key;};typedef struct STnode* link;struct STnode{ Item item ; link next;};static link* heads , z ;stat

源代码如下：#include #include #define hash(v,M) (v % M)#define null(A) (key(st[A]) == key(NULLitem)) typedef char Key;struct Item{ Key key;};static struct Item NULLitem ;static struct Item *s

#include #include typedef struct node *link;struct node{ int item ; link next;}; void josephus(int n, int m){ int i ; link head = (link) malloc(sizeof (link) ), x = head ; head -> item = 1;

#include #include int heads(){ return rand() < RAND_MAX/2;} main(int argc, char *argv[]){ int i , j , cnt; int n = atoi(argv[1]) , m = atoi(argv[2]) ; int *f = (int *)malloc((n+1)*sizeof(in

#include #include typedef struct node *link; struct node{ int item ; link next;}; void visitData(link x){ link t; for( t=x ; t != NULL ; t = t -> next) printf("%d\n",t->item);}void cre

中缀表达式转 后缀表达式#include #include #include typedef struct STACKnode* link;struct STACKnode{ char item ; link next;};static link head ;link NEW(char item, link next){ link x = (link) malloc(s

#include static int record[40]={0};void count(int n){ record[0]=1; record[1]=1; for(int i=2;i<n;i++) record[i]=record[i-1]+record[i-2];}main(){ count(20); for(int i=0;i<20;i++) printf("

#include #include #define ElemType chartypedef struct BiTNode *BiTree;struct BiTNode{ ElemType data; BiTree lchild,rchild;};BiTree CreateBiTree(){ ElemType ch; BiTree T; scan

#include #include #define ElemType chartypedef struct BiTNode *BiTree;struct BiTNode{ ElemType data; BiTree lchild,rchild;};typedef struct STACKnode* link;struct STACKnode{ BiTree ite

#include #include #define ElemType chartypedef struct BiTNode *BiTree;struct BiTNode{ ElemType data; BiTree lchild,rchild;};BiTree CreateBiTree(){ ElemType ch; BiTree T; scan

以下是源代码：#includeusing namespace std;#define MAX_VERTEX_NUM 20typedef int EdgeData; typedef char VertexData; //顶点数据域 typedef struct node { // 边表节点 EdgeData cost; //边上d权值 int adjvex

源代码如下：#includeusing namespace std;#define MAX_VERTEX_NUM 20typedef int EdgeData; typedef char VertexData; //顶点数据域 typedef struct node { // 边表节点 EdgeData cost; //边上d权值 int adjvex;

#include void sushu(int N){int i, j, a[N];for(i=0;ifor (i=2;iif(a[i])for(j = i ; i * j for (i=2;iif(a[i])printf("%6d",i);}main(){sushu(10000);}