stringmatch

道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)

自己做的一个用用栈实现类的操作，是课内作业，希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)

NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

这是一个简单的银行模拟系统 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.)

这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )

一个很好的银行家算法，能运行(A good banker s algorithm, will be able to run)

实现对二叉树的操作：建树、遍历、求层高、叶子数和结点数等(binary tree)

可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)

数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)