资源列表
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
jssl
- 本程序为重力有限元程序，基于徐世哲院士的有限元书籍编写。
vc++实现二值化.
- vc++实现二值化.实现了图像二值化变换的功能，用vc++完成喜欢数字图像处理的可以仔细看看带代码，一起学习一起进步~
lcs
- 用python实现了最长公共子序列LCS代码，分别应用递归方法和动态规划实现。并且实现了三个字符串的最长公共子序列。-Using Python to achieve the longest common subsequence of LCS code, respectively using recursive method and dynamic programming. And the realization of the longest common subsequence of three
The-path-selection
- 用easyX实现的路径选择问题，包含easyX库文件和源文件，供学习使用-Use the path selection problem easyX implementation, including easyX files and source files, for learning to use
TSP-PROBLEM
- C99标准实现的动态规划法和分支定界法解决TSP问题-Dynamic Programming Method and Brand-and-Bound Method Solving TSP Problem Under C99 Standard