数据结构中的DFS问题

这是将中缀表达式转换为后缀表达式的代码。中缀到后缀转换使用堆栈。各种使用的函数包括基本堆栈操作，如overflow（）、int underflow（）、void push（）、int pop（）、int peep（）、void display（）等。

c++链表模板类，实现所有链表的功能！包括增删改查，反转、递归反转等功能。对数据结构初学者有极高的参考价值。且代码规范，命名规范，有很多注释帮助理解。

插值类 CInterpolate 一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元全区间插值-interpolation category CInterpolate one yuan is not equidistant between the region interpolation one yuan region equidistant between 3:00 interpolation one yuan is not even fractional offset interpolation is not equidistant interpolation Hermite"s not equidistant interpolation smooth interpolation is not equidistant between two yuan region Interpolation

这是一个用Java语言编的一个小程序，主要教java初学者如何使用java语言，本例实现数据结构中如何实现排序的一个小例子-This is a use of the Java language in a series of small procedures, the java java beginners how to use the language, in this case the data structure of how to achieve a ranking of small examples

在 Visual Basic 6.0 开发项目。它是一个快递管理系统来管理和跟踪快递。欢迎大家下载、试用。谢谢大家的支持！

够你们交作业了-enough perpendicular operation of the Ha Ha

完全内核，界面的改变，增加学生统计、 院系、班级等管理功能 　　1.添加单个成绩 　　2.批量添加成绩 　　3.通过搜索并修改与删除 　　4.直接修改 　　5.可以批量删除 　　6.可以直接GO到达你想到达的页 　　7.分页显示 　　8.代码精简 　　9.整合部分重复代码 　　v2.82 build1114版 　　1、增加了Excel名单文件上传、导入功能 　　2、为了正确指定文件上传目录，各文件夹名中不许有字符“.”，故将原命名方式“School V2.82 Build1114”改为“School V282 Build1114”。 -completely kernel, interface changes, the increase in student enrollment statistics, faculty, classes such as a management function. Add two individual achievements. Batch added three results. Search through deletion and modification In addition to four. directly alter five. Batch 6 can be deleted. GO can reach you directly to the arrival of page 7 . Pagination 8. 9 streamlined code. Integration of duplicate code v2.82 build111 4 version of an increased list of Excel file uploads into two functions. , Therefore, the original name means "School V2.82 Build1114" to "School V2 82 Build1114. "

用链表实现的大数阶乘，可以计算n万的阶乘，不过3万以上，时间就很长了。-List realize with the factorial of large numbers, can calculate the factorial of n million, but more than 30,000, time is very long.

数据库实习的很好的课题-database attachment very good subject

本演示程序演算约瑟夫环问题，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.