▍1. 数据结构效验算法
数据结构效验算法-data structure well-tested algorithm
基于ADODC和ACCESS的客户管理程序,可实现客户信息的添加、删除、查询、修改等。-Based on customer management ADODC and ACCESS programs for customer information to add, delete, query, modify and so on.
本演示程序演算约瑟夫环问题,人数n应为任意的,首先应输入一个值赋给初始报数上限m,程序应能自动保存出列人的序号和将出列的人所持的密码赋给m,再次作为报数上限,如此循环,直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.
vc开发的二次探测在散列算法,学习数据结构的学习者看看吧!! -vc developed to detect the secondary hash algorithm, the data structure learners see! !
单纯形法,可以用于进行线性规划解的求取。在数学上有一定的应用价值,但速度上可能不太优化,如果对速度有要求的,可参考MATLAB-Simplex method, linear programming solution can be used to carry out the strike. In mathematics there is a certain value, but the speed may not be optimized for speed if required, can refer to MATLAB
VB和ACCESS作的物品管理软件 比较容易分析-VB and Access Management for the items easier analysis software
本人自编的解八皇后问题的程序,用了大量的指针实现。-I own eight-Queen
dbcmp是一个数据库内容比较工具。用于比较数据库的两个表数据之间的差异,并通过WEB的形式高亮显示。dbcmp运行于Linux/Unix平台,目前只支持Oracle.运行前用户要配置dbcmp.cfg、dbcmp.tbl、dbcmp.xcols文件. 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
回文算法实现,代码已经验证-Palindrome algorithm, code validation
基于二叉树的图最有路径算法,在图能转化到二叉树表示时,可求解-the best path based on binary tree
一个工程管理程序!我的毕业设计-a project management procedures. I graduated from the Design
本文章首先简要介绍了一维与二维情况下的最接近点对问题与所涉及到的解决算法.然后,把最接近点对问题延伸至三维,提出了自己的解决思想,并提供了相关伪代码,以供参考.请各位朋友多提建议!-err
CSharp下的图书管理系统源码,值得学习-CSharp under the library management system source code, it is worth learning
最小生成树问题 若要在n个城市之间建设通信网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网,是一个网的最小生成树问题。 (1)利用克鲁斯卡尔算法求网的最小生成树。 (2)实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.
用数据结构做的约瑟夫问题,其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election