用内嵌法求多项式

严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah

大数相乘的源代码,使用C++在VC环境中实现.-multiply large numbers of the source code, the use of C in the VC environment to achieve.

VC++程序实现读写EXCELL数据,可以演示执行代码-VC++ Program Excel to read and write data, you can demo the implementation of the code

应用背景基于网络的购物网站；特征用户可以添加nrew产品新用户还有更多……关键技术HTML / CSSPHP MySQLAdobe PS图象处理软件

很不错的Access数据库结构打印工具，方便您在编程时助记数据库字段，可以输出到打印机，保存为HTML文件。能很清楚的列出数据库的所有表的字段信息、索引信息等。 -quite the Access database structure Print tool to facilitate the programming your reporter database fields, can be output to the printer, the depositary for the HTML document. Can be clearly set out all the tables in the database in the field of information, indexing information.

7中内排序的c语言代码,包括:直接插入,shell,选择,冒泡,等等排序算法-7 within the sort of c language code, including: direct insertion, shell, selection, bubble, and so sorting algorithm

包括字符串反转， 链表反转， 判断两个数组中是否存在相同的数字， 判断链表是否存在环， 找出单向链表的中间结点， 如何判断一棵二叉树是否是平衡二叉树， strstr()的简单实现，-Including the string reversal, list reversal, to determine the existence of two different array of figures to determine the existence of ring list, find the middle of a one-way linked list nodes, how to determine whether it is a balanced binary tree Binary Tree, strstr () to achieve a simple,

清华大学数据结构课上实现的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;

堆栈程序！关于数据结构-stack procedures! On the data structure

C++数据库管理源代码，连接数据库后，可直接调用里面的函数对数据库进行操作，有修改-C++ Database management source code, database connectivity, you can directly call the function inside the database operation, has modified