资源列表
Text1
- 数据库文件自带注册系统，含文件分流，扩展选项，可自行扩展-Registration system comes with a file containing documents diversion, expansion options and scalable self
experiment-three
- 数据结构实验代码加报告，实验内容为有序链表的元素按照从小到大有序存储；实现有序链表的类模板，用有序链表表示集合，实现两个集合的并和交（并和交仍是有序链表）并分析它们的时间复杂度-Experimental data structure code plus report, the contents of an ordered list of test elements are stored in ascending order to achieve an orderly list of class
experiment-two-
- 数据结构实验：实现分数的+,-,*,/，=,<,>,==等运算符重载,2.实现分数的输入：按照分别输入分子和分母的方式输入；3.实现分数的化简，至少用两种方法实现（辗转相除法）；比较两种分数化简方法的效率,实现分数的输出，格式：5/31； 6/5；100/300；要求输出的分数是简分数-Experimental data structure: achieve scores+,-,*, /, =, < ,> , ==, such as operator overloading,
3.zadaca1
- Matrix sum, product and exponentation, Programming techniques
3.zadaca3
- Geometrical operations with Dot structure
3.zadaca5
- Geometrical operations with Triangle structure, Programming techniques
4.zadaca1
- Library member structure, Programming techniques
4.zadaca2
- Student and Class structures, Programming techniques
suanfa
- 利用分治算法和蛮力算法求最近点对的长度问题-Use divide and conquer algorithm and a brute-force algorithm for the nearest point on the length of the problem
8-2
- 在查找二叉树中增加三个功能：删除小于某一值的所有元素；删除大于某一值的所有元素；删除某一范围中的所有元素。-Increase in the binary tree to find three functions: remove all elements smaller than a certain value delete all elements is greater than a certain value delete a range of all the elements.
8-3
- 要求把插入、查找和删除函数用非递归的方式实现。-Asked to insert, find and delete functions for non-recursive way.
Binary-data-sorting-program-design
- 1) 要求实现3-4种数据排序算法,能够设定排序模式(升序或降序)。 2) 数据来源可手动输入，也可来自文件，输出结果可以保存。 -1) required to achieve 3-4 kinds of data sorting algorithms, sorting mode can be set (ascending or descending). 2) The data source can be entered manually, but also the