搜索资源列表
biosID
- Read or Write Bios for DOS environment。-Read or Write Bios for DOS environment，Function is used modify BIOS Function item。
Apriori_CSharp_SourceCode_without_exe
- Apriori[1] is a classic algorithm for frequent itemset mining and association rule learning over transactional databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as lo
sort
- Sorting choice. The idea of the method is to create a sorted sequence through the merger of one item after another in the correct order. If the input sequence is almost ordered, then comparisons will be the same, then the algorithm behaves abnormally
Knapsack
- 算法设计与分析中背包问题。 首先将最优解矩阵的第一行和第一列均赋值为0；然后从上至下、从左至右依次计算m[i][j]的值，如果第i个物品 的重量大于j的值，即第i个物品不放入背包中，则将m[i][j]赋值为m[i-1][j]，否则取第i个物品放入背包和不放入背 包所得价值的最大值；最后从后往前计算最优解向量的值，如果m[i][j]=m[i-1][j]，则将x[i]赋值为0，否则将x[i] 赋值为1，并将j减去第i个物品的重量。-The knapsack problem al
c-soucecode-for-yanhui
- 颜辉版C语言程序设计的实验源码，自己写的，包含所有有难度的题目。-the exercises source code for yanhui s c programming, write by myself, include all the difficulty item.
main
- 数据挖掘中的Apriori算啊，用于计算频繁项集-Data Mining Apriori count ah, used to calculate the frequent item sets
Converter
- RF Online Server Code Item to Client Code Item
lab02
- f(n)=f(n-1)+f(n-2) f(0)=f(1)=1，求斐波那契数列第20项，分别用循环和递归的方式，比较时间效率。提示：可以使用c函数clock取出当前系统时间，计算前后各一次，两次相减除以每秒的时钟数，就可以得到以秒为单位的差距-f (n) = f (n-1)+ f (n-2) f (0) = f (1) = 1, Item 20 seeking Fibonacci number Fibonacci sequence that were circulating and recursi