搜索资源列表
FormulaProcessor_beta1_CSharp
- 功能说明： 次组件提供的功能有二： 1、解析出数学表达式中的参数 2、计算数学表达式 此组件不但可以解析和计算数学表达式，还提供了一系列的数学基本函数，可应用于表达式中一块处理。提供的数学基本函数有：将值舍入到最接近的整数 rount(x)、向下取整函数 int(x)、向上取整 ceiling(x)、求两个数中最大数的函数 max(a,b)、求两个数中最小数的函数 min(a,b)、幂函数 pow(x,n)、求平方根的函数 sqrt(x)。 下载地址：http
Newton
- 用牛顿下山法求方程的近似解，并另付实验报告。-Newton descent method with the approximate solution of Equation, and the extra test report.
BSTREE
- Binary Search Tree Implementation with extra features like Maximum Depth of a tree, Minimum element in the BST and Mirroring of BST.
code
- 找出两个字符串的最长公共子串。 给出一个字符串，请删除该字符串的前导空格和尾随空格，中间的空格若多余1个删减到1个。 我是个菜鸟，但软件会是我终生的事业~我有信心学好它，希望站长通融-Two strings to find the longest common sub-string. Given a string, remove the string leading spaces and trailing spaces, if the extra spaces in the middle
high
- 使用longint每31位进行高精度加发运算-Use longint each an extra 31-bit high-precision operation
heap_sort
- heap sort is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure tha
insertion
- is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort
rayTracing
- Simple c++ implementation of the ray tracing algorithm that requires no extra libraries.
graphcut
- Example of the graph-cut algorithm in c++. Flowed for a simple implementation for graphs. No extra libraries required
pathTracing
- Simple C++ Implementation of the path-tracing algorithm for computer graphics. It requires no extra libraries.
count_num
- 数字计数问题： 一本书的页码从自然数1开始顺序编码到N。 页码按照通常的习惯编排，即每个页码不能含多余的前倒数0， 例如，第2页的页码为2，不能是02、002等。 数字计数问题要求从键盘输入页数N， 输出全书页码中分别用到0~9的数字的次数。-Digital counting problem: The pages of a book the natural number coding to N 1 began to order. Page number acco