搜索资源列表
1977+Algorithms+for+the+Longest+Common+Subsequence
- 最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
commondrainamplifier
- HSPICE architectural source code and simulation results for a CMOS Common-Drain Amplifier
c-common-library
- 按英文首字母 排列收集c语言常见函数库 可以方便c语言编程用户方便查找-Collection in alphabetical order by c language common library
the-greatest-common-divisor
- 求2个数之间的最大公约数，随便输入2个数字会得到他们之间的最大公约数-Find the greatest common divisor between two numbers, casually enter the two numbers will be the common denominator between them
Common
- Unit with common functions
CPP-common-mothod
- 面向对象源码 常用算法 累加 阶乘 求最大最小值 求最大公约数 数组元素-For object source commonly used algorithms accumulate factorial seeking maximum and minimum demand the greatest common divisor of array elements
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables c
C-P-P-Common-Errors
- 关于在使用C++编程时的一些常见错误汇集，可以便于读者查找自己在编程时遇到的常见错误-Brings together some common mistakes when using C++ programming can facilitate the reader to find the common errors encountered when programming
The-longest-common-subsequence-
- 最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
DELPHI-common-properties
- 在网上搜到的“DELPHI常见属性说明”感觉不错传上去-In the online search to " DELPHI common properties that" feel good pass to go up
oracle-Common-Command-Summary
- oracle常用命令总结，包括dml操作，dql查询，数据库参数设置等等。-Oracle common commands summarized, including the DML operations, DQL query, the database parameter Settings, and so on.
Common-data-mining
- 常见数据挖掘错误，识别及纠正，使用这些技巧，可以大大减少构建有效模型的时间，并提高模型的质量-Common data mining: identification and correction of errors
Common-design-patterns-in-cPP
- 常见设计模式的解析和实现,通过C++编写-Common design patterns and the realization
common
- Common arcitecture for ARM cortex based MCU
Common-Subsequence
- poj 1458 A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a stri
Nearest-Common-Ancestors
- In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is al
common-tan
- 基于matlab求解公切线，使用了网络搜索法-Based on matlab solving common tangent, using a web search method
the-greatest-common-divisor-
- <1> 用辗转相除法求最大公约数 算法描述: m对n求余为a, 若a不等于0 则 m <- n, n <- a, 继续求余 否则 n 为最大公约数 <2> 最小公倍数 = 两个数的积 / 最大公约数*/-< 1> with the common denominator Euclidean algorithm descr iption: m for n remainder of a, if a is not equal
graph-theory-common-algorithms-
- 图论算法 包括生长树 迪杰斯特拉 最大流 佛洛依德算法-graph theory common algorithms