数据结构与算法分析中创建链表，实现多项式相加

这是一款简单的ASP考试系统，可供无复杂用途的用户下载使用-This is a simple ASP web system for complex applications without the use of users to download

一个能求图中任两顶点之间的最短距离的程序-seeking a map to the two vertices of the shortest distance between the procedures

数据库远代码，比较好的java实现的，比较清晰好用-The database is far code, java to achieve a better, more clear and easy to use

需要sql的支持-need the support sql

包括字符串反转， 链表反转， 判断两个数组中是否存在相同的数字， 判断链表是否存在环， 找出单向链表的中间结点， 如何判断一棵二叉树是否是平衡二叉树， 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,

将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。-Ma immediately on the international chess 8 8 chessboard Board [8] [8] of a box, MA by the rules of chess go mobile. Requires each box only entered once traveled chessboard all 64 box. Preparation of non- recursive procedure, and seeking stepped routes, with a calculated routes, the figures 1, 2, ..., 64 were filled an 8 x 8 matrix, put it out.

这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.

用VC&&ACCESS开发-development with VCACCESS

在自己的程序中完成SQK2K中的数据库的备份和恢复。虽然调用外部程序来完成，但是在自己的MEMO窗口中显示外部程序的字符界面输出。-in their procedures completed SQK2K the database backup and recovery. Although the call external procedures to be completed, but in their own MEMO window shows the characters external program interface output.

基于数据结构的相关知识点，构造的基数排序-Knowledge-based data structure point of radix sort