资源列表
suanfafenxiyushejiWangxiaodong
- 常用算法的java实现不错的书 特此贡献大家 好书一起分享-java commonly used algorithm to achieve a good book you would like to contribute books to share
FittingApproximation
- 收集的一些常用算法，分得很细，使用方便，与大家分享-collection of some commonly used algorithm, at very small, easy to use and share
libnumrecognitiondemo_0.01
- number recognition! n umber recognition! number recognition!-number recognition! N umber recognition! Number recognition!
SUMTtttttxxx
- 内点惩罚法,fortran77编制可以在visual fortran运行-penalty points within the law, can be prepared in FORTRAN77 visual FORTRAN running
huffmanFORdatastreamcompress
- 用于数据流压缩的huffman算法源代码，c++编写，程序十分简练-data flow for the Huffman compression algorithm source code, c preparation, the procedure was very concise
bintytrees
- 二进制查找树实现代码 BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
btree-vv
- 图书馆管理系统，3阶b树 数据结构实验，简单易懂 初学者的作品-library management system, three bands b experimental tree data structure, simple works beginners
mergesort11
- 二分搜索是运用分治策略的典型例子。二分搜索方法充分利用了元素间的次序关系，采用分治策略，可在最坏情况下用O(logn)的时间完成搜索任务。-two hours search is to use the divide and conquer strategy is a typical example. Two-search method full use of the elements in the order, using the divide and conquer strategy, in
mul
- 在应用中常用矩阵相乘的定义算法对其进行计算。这个算法用到了大量的循环和相乘运算，这使得算法效率不高。而矩阵相乘的计算效率很大程度上的影响了整个程序的运行速度，所以对矩阵相乘算法进行一些改进是必要的。-commonly used in the application of the definition matrix multiplication algorithm for calculation. The algorithm uses a number of cycle and multiplic
testKrouteDll2
- 一个使用k路由算法的例子，给你的是k路由的DLL，尽管用就是了。-a routing algorithm used the example to you is the DLL k routing, despite using the grindstone.
top_sort
- 这是我在复习备考软件设计师时,写的一个程序,拓朴排序在很多方面都会very important,so i think it will be useful many new hands,so i decide to upload it -This is my review of the Notes software designer, wrote a procedure Topography ranking in many ways very important city, so i think
redblack
- 用C 语言编写的红黑树，主要是插入树和删除树的部分 自己写了别的部分 。-C language's black tree, the tree is inserted and deleted part of the tree itself was another part.