搜索资源列表
大数的阶层
- 用数组存储一个大数的阶层。输入一个整数n,先求出n!占用的位数。动态开辟bits位数组，用适当方法把n!的值存储到数组里去-storage arrays with a majority of the class. The importation of an integer n, first obtained n! The median occupancy. The median opening bits dynamic group, the use of appropriate means, n
magic_1
- 魔方的算法,即每行每列和对角线上的数值和相等,算法值得研究研究-Magic Square algorithm, which means that every line and every out on the diagonal and the same numerical algorithm worth studies
main
- 在现代的企业管理中，火车管理系统有着重要作用。由于现代的竞争力的加强，讲究效率，不管是时间、还是地点，两地的生意常常因为距离而无法得到理想的解决。火车作为一个传统的交通工具，需要进行改革。由于订票、退票常常给乘客带来一定的麻烦，因此作为一个火车管理系统解决了这个问题。它方便乘客最快地订到自己想要的票也同时解决了退票的问题。-in modern enterprise management, train management system plays an important role. Conte
zzx
- 这是一道大学生信息学奥林匹克竞赛的试题的解答，里面应用了特殊的控制手段来限制递归算法的递归深度，这种手段在利用递归结决问题时非常有借鉴意义。-students Informatics Olympiad answer the questions, inside a special application of the control measures to limit the recursive algorithm recursive depth, this means the use of re
guize
- The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first charact
feibonaqi
- 经典的斐波那其算法程序，经调试成功。采用第归方式实现。-classic Fibonacci algorithm then its procedures, debug success. Adopt naturalization means.
k均值聚类算法分析
- k均值聚类算法分析，采用C++编程技术，提供代码可重用机制 -k-means clustering algorithm analysis, the use of C programming, code reuse mechanism
levelTree
- 按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage
DS123
- 用C语言实现动态表的源程序，包括各种必须的方法-C language movements of the source, including all necessary means
kmeans
- 基于c++的k-means算法，效果比较明显。
PostFixCompute
- postfixComputer, Calculate the postfix expression, such as 45+,which means 4+5,and the result is 9. The program is very applied.
Kode-Program-Algoritma-Fuzzy-C-Means
- Fuzzy clustering is a class of algorithms for cluster analysis in which the allocation of data points to clusters is not "hard" (all-or-nothing) but "fuzzy" in the same sense as fuzzy logic.
CPPK-means
- K均值聚类首先需要确定聚成几类，然后按照迭代的方法，计算类的重心，然后按照向量和类重心的聚类重新分类，反复重复，直到分类稳定或者重心稳定。-K means clustering first need to identify clustered into several categories, and then follow the iterative method to calculate the focus of the class, and then follow the center of
K-means
- 数据挖掘中得k-均值算法的c++实现，可以使你对数据挖掘算法有个初步的了解。-k-means algorithm in data mining is achieved with c++ . Allows you to have a preliminary understanding of the data mining algorithms.
K-means
- K-means算法是很典型的基于距离的聚类算法，采用距离作为相似性的评价指标，即认为两个对象的距离越近，其相似度就越大。这是一本介绍K-means算法的英文书籍 -K-means algorithm is very typical distance-based clustering algorithm, using distance as the similarity evaluation, that the closer the two objects, the greater the s
K-Means
- 给定数据文件，实现k-means算法聚类。-A given data file,get the k-means algorithm clustering.
K-MEANS
- k-means算法 网上681武将的聚类算法代码 非mapreduce实现 -k-means algorithm
CPPk-means
- K-MEANS算法实例，可以用于数据聚类分析，现成的源代码-K-MEANS algorithm instance, can be used for data clustering analysis, existing source code
k-means
- k-均值聚类算法（C语言实现）： 给定类的个数K，将N个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。-k-means clustering algorithm (C language): given the number of classes K, N objects will be assigned to the K class, making the class the biggest similarity between objects, and the s
k-means-2d-rand-point
- K_means经典聚类算法，用点阵可视化 通过产生随机点，不断更改中心点实现聚类-K Means classic clustering algorithm, with lattice visualization By generating random points, and constantly change the center point to achieve clustering