Yan Wei

数据结构上机实验内容 索引顺序表的查找源程序代码-data structure on the plane experiment content indexing table lookup sequence source code

重言式是当所有逻辑变元取遍所有值时都为真的表达式。这个程序是用来对重言式进行判别的！还可以吧！牛人别见笑！-tautology is when all logic variables take out all values are true expressions. The procedure is used to tautology runs! Also! Other cattle were laughed at!

拖动开发代码，关于pb 的-Drag code on the pb

sybase 数据库的写法模拟,使用ct_library-the wording simulation, the use of ct_library

将数据从文本文件中按照规定格式装入INFORMIX数据库中，再从数据库中转出为文本文件并同时剔出相同号码-data from the text file format required load INFORMIX database and then transferred from the database to a text file and to get rid of the same number

经典的数据结构算法-classical algorithm data structure

java数据结构方面的，关于二叉树，很简单、实用-data structure, for the binary tree, a very simple, practical

用迪杰斯特拉算法求解最短路径问题，这个算法是我自己编出来的 ，感觉有很多冗余之处，请大家一起改正-Using Dijkstra shortest path algorithm, this algorithm is out of my own, I feel a lot of redundancy, please everyone together to correct

这是一个经典的数据结构动态演示系统,支持C语言和pascal语言,对初学者肯定会有很大帮助-This is a classic demonstration of dynamic data structure, and C language support pascal language for beginners certainly be of much help

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;