资源列表
CircList
- 循环队列，实现循环链表。当走到队尾时，自动回到队头。-Circular queue, linked list implementation. When the team reached the end, the automatic return to the first team.
AVLTree
- 平衡二叉树。高效的搜索算法。生成深度最小的二叉搜索树。在大量数据中最快实现搜索。-Balanced binary tree. Efficient search algorithm. Generated the smallest depth binary search tree. Large amounts of data to achieve the fastest in the search.
poly
- 用线性表，链表实现多项式的加减乘等运算。大家要注意指针（尤其是队头指针）的变化。-The linear form, linked to achieve polynomial addition and subtraction, multiplication and other operations. If we want indicators (especially team head pointer) changes.
paixu
- 实验名称：内部排序操作 实验题目：若待排序的关键字序列是: {103,97,25,14,80,6,38,65,21,30,124,17,54,47},请用以下方法进行排序,并输出排序的结果 用基数排序法进行排序。-Experiment Name: Experiment topics within the sorting operation: If the keywords to be sorted sequence is: (103,97,25,14,80,6,38,65,21,30,1
polynomial
- 此为多项式计算器的实现，实现多项式的加减，求导，求值运算-This is the realization of polynomial calculator to achieve polynomial addition and subtraction, derivation, evaluation operations
SparseMatrix
- 此为稀疏矩阵运算器，用数组实现，可实现矩阵的加减乘运算。-This is a sparse matrix solver, with an array of implementation, enabling the addition and subtraction matrix multiplication.
Stemming
- 信息检索对关键字的前期处理，保留关键字的词根作为检索对象-Stemming program for Information Rerieval.
Tree
- 1.16② 试写一算法，如果三个整数X，Y和Z 的值不是依次非递增的，则通过交换，令其为 非递增。 -Status Dencendant(Array1D L,Array1D R,int n,int u,int v) /* If node u is the dencendant of node v ,*/ /* then return TRUE else return FALSE . */ /* L[i] is the left child of the
common_numeric_algorithm_in_mathematica_modeling.z
- 最小二乘法，二分法，龙格库塔算法等15个常用算法的C++实现。-Least squares method, dichotomy, Runge-Kutta algorithm commonly used algorithms in 15 C++ implementation.
ArabicFeaturesExtractor
- to find arabic text feature
tokenizer
- this the code for knn algorithm-this is the code for knn algorithm
nn
- this the code for nn algorithm in c-this is the code for nn algorithm in c++