神经网络中的K均值聚类算法II： 1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数...

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.

设编号为1，2，···，n的n个人围坐一圈，约定编号为k（1≤k≤n）的人从1开始报数，数到m的那个人出列，他的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。

数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree

随机输入n跳直线 利用增量算法 在一个方块区域内实现他的dcel图 利用opengl把效果图展示出来 -Stochastic input n-hop linear incremental algorithm in a box to use within the region to realize his plan to use opengl to dcel effect diagram displayed

数据结构栈和队列基本源代码，并包括银行模拟、中缀表达式计算、列车调度、农夫过河问题等经典数据结构算法。-Stack and queue data structure of the basic source code, and includes Bank of simulation, in the calculation is made up of expressions, the train scheduling, the farmer across the river, such as the classic problem of data structure algorithms.

几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣.-several commonly used algorithm efficiency comparison, the test may come this algorithm several merits.

用C语言实现数据结构的几种常用结构，还包括关键路径的程序。-C language data structures Several structures, including Critical Path procedures.

数据结构经典：《用C++描述数据结构》 作者：埃利斯・霍罗维茨 1997-Data Structure classic:

VB6与三菱FX PLC 编程口通讯（遍历读FX-PLC的映象区）字号 操作状态CommExit: 0通讯进行状态,通讯被打断 通讯状态CommEnd:开始发送和等待接收,>1:接收串已结束-VB6 with Mitsubishi FX PLC Programming mouth communications (FX-PLC read traversal of the image area) to operate a state-established CommExit: 0 communication status, communication was interrupted communication state CommEnd: to start to send and waiting to receive,

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of