twxyz123的专栏

#include void BubbleSort(int a[], int size);void InsertSort(int a[], int size);void swap(int &a,int &b){ int t= a; a = b; b = t;}void PA(int a[],int size){ for(int i=0;i<size;i++) printf(

#include #include #include #define NMAX 20//最大顶点个数#define EMAX 20//最大的边数#define NULL 0#define InfoMax 999//用999表示正无穷typedef int VexType;//图的顶点的数据类型typedef float adjType;//图中边的带权值类型/********

/queue.h //队列，链表存储#include #include #include typedef int ElemType;typedef struct QNode{ ElemType data; struct QNode *next; }QNode; typedef struct { QN

MyString.h//MyString.h#ifndef MYSTRING_H#define MYSTRING_H#include#include#include#define MAXSIZE 100/**链表存储**/typedef struct StrNode{ char ch; struct StrNode *next; int length;}StrN

#include #include #include #define MAXSIZE 100//#define NULLKEY -1//#define DELKEY -2//typedef int KeyType;//typedef char *InfoType;///********开放定址存储*************/typedef struct{ KeyType k

#include #include #include #include #define MAXSIZE 20typedef struct TreeNode{ int Num;//记录这个人的子女数 char name[20];//姓名 struct TreeNode *NextNode[MAXSIZE+1];//记录儿女结点 struct TreeNode *parent;/

栈的功能//栈的顺序存储//stack.h#include#include#define MAXSIZE 100typedef char ElemType;typedef struct //SqStack{ ElemType a[MAXSIZE]; int top;}SqStack;void init_s(SqStack *s){ s=(SqStack *)m

//MyList.h#ifndef MYLIST_H#define MYLIST_H#include#include#define MAXSIZE 20typedef int ElemType; typedef struct{ ElemType a[MAXSIZE]; int length;}SqList;void creat_list(SqList *L);//创

// ttt.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include #include typedef struct FileHead{ double iVersion; char AuthorName[20]; long fileLen

//栈的顺序存储//stack.h#include#include#define MAXSIZE 20typedef int ElemType;typedef struct //SqStack{ElemType a[MAXSIZE];int top;}SqStack;void init_s(SqStack *s){ s=(SqStack *)malloc(sizeo

Main.cpp#include #include #include #include "BothNode.h"void main(){ Node *h; char c,index,ch='0'; int n; h=(Node *)malloc(sizeof(Node)); printf("创建一个双向链表:\n"); CreateNode(h); PrintNo

/*无意中翻看以前的日志，看到我先前的单链表程序，里面竟有许多错误。那会刚开始学习C语言，对于指针和内存的操作介于半懂，但还是自以为是的认为自己写的不错。所以这次重新把链表写了一遍，不敢保证完全正确，只能说在前面的基础上提高。攀登程序这座高峰，只能是越攀越高，从来没有到达顶峰的那一天。tangwen 2010-12-31*/main.cpp/* ================

#include #include #include typedef char TypeData;typedef struct TreeNode{ TypeData data; struct TreeNode *lch,*rch;}TreeNode;TreeNode *CreateTree();void PreOrderTraval(TreeNode* pTree);//先