zhaose

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

数据结构课程设计 -电话本（运用了MFC图形化界面）(Curriculum design- the phone book)

实现链表的一些操作，方便进行遍历，查找等程序(Operation, convenient linked list traversal, the search procedure)

这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机（不同业务处理的平均长度不同，例如：取款时间较短，开户和销户时间较长） 3、 处理客户业务所需时间随机（在一定范围内） 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示（刷新时间可调）目前每个窗口累计处理客户数量、等待人数，每个窗口的平均业务处理时间，不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)

本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)

This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.

用从语言实现飞机订票系统。程序中用到了数据结构中的队列和栈。(From the language used airline reservation system. Process the data structure used in the queue and stack.)

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度(c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling)