Ibigprogramer的博客

#include #include typedef int Elemtype; typedef struct TreeNode *SearchTree; typedef struct TreeNode *position; struct TreeNode { Elemtype Element; SearchTree Left; SearchTree Right; }; /*建立一颗空树*/

一. 静态查找表 静态查找表是仅对查找表进行查找操作，而不能改变其中数据的线性表，可以是基于数组的顺序存储或以线性链表存储。静态查找表主要有顺序表、有序顺序表和索引顺序表三种。  1. 顺序查找 函数模型 int seqsearch(element list[], int searchnum, int n) { int i; for (i=0;i < n; i++) //遍历这n个

#include #include #include #define Maxsize 10 typedef char elemtype; struct Node; typedef struct Node *PtrToNode; typedef PtrToNode Stack; typedef struct Node { elemtype ch; Stack next; }Node; S

#include #include typedef int ElemType; typedef struct Lnode { ElemType date; struct Lnode* next; }*LNode; LNode InitLnode(void) //初始化链表 { LNode L; L = (LNode)malloc(sizeof(struct

#include #include typedef int ElemType; typedef struct Lnode { ElemType date; struct Lnode* next; }*LNode; LNode InitLnode(void) //初始化链表 { LNode L; L = (LNode)malloc(sizeof(struct

#include #include typedef struct student { int num; //学号 char name[20]; //姓名 float Chinese; //语数外成绩 float Math; float English; float Average;

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 30807   Accepted: 9947 Description Farmer John wants to repair a small length of the fence aroun

#include #include int lowbit(int x) { int z; z = ~x; z++; return (x & z); } //测试 /*int main(void) { int n,t; n = 50; while(n) { t = lowbit(n); printf("%d\n",t); n -= t; } return 0; }

#include #include typedef struct node { int key,dist; struct node *Left,*Right; }LeftistTree; void Swap(LeftistTree** a,LeftistTree** b) { LeftistTree *tmp; tmp = *a; *a = *b; *b = tmp; } Leftis