matrix inversion c procedures for the large

迷宫程序,C++实现 一个用VC写的关于迷宫的程序-maze procedure, C to achieve a VC was on the maze procedure

本人制作的8位CPU,有简单的加减,输入,输出操作,希望大家好用-I produced eight CPU, has a simple addition and subtraction, input and output operations, I hope everyone use

企业进销存管理系统-Enterprise Management System

希望大家能多多指教这是我给我们同学编的系统-hope that we can enlighten a lot to me this is part of our classmates system

多种方法解决全排列的问题 在vb环境下编写-various methods to solve all problems with the environment in preparation vb

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

三种排序方法的动态演示，可以同时开启多个线程，同时用不同的方法进行排序，直观的判断不同算法的排序效率。-three sequencing method of dynamic presentations, it also opened a number of threads, in addition to the use of different methods for sequencing, intuitive judgment different sorting algorithms efficiency.

网上有很多的压缩程序，本程序实现了最简单的一种算法－lzw压缩算法，其中用到了hashtable-many online compression procedures, the procedures for the realization of a simple algorithm-lzw compression algorithm, which stretched to the hashtable

用友u860数据字典 内容在Access数据库中 -UFIDA u860 data dictionary content in the Access database