资源列表
quick_sort
- 快速排序，实现排序的时间再一般情况下的时间复杂性为nlogn算法实现-Quick Sort and achieve ranking period of time under normal circumstances the complexity of finite algorithm
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
HnSRTree-2.0beta5a
- SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video a
libgist-2.0.1
- Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index stru
unix suanfa
- 主要是一些算法问题 unix/C 开发，矩阵，网路等问题-algorithm is the main problem unix / C development, matrix, the Internet and other issues
Data Structures And Problem Solving Java Source Co
- 这是数据结构与问题求解的Java版的源码-This is the data structure and problem solving version of the Java source code
C Algorithm_配套源码Robert Sedgewick
- 这是Donald Kunth（计算机科学学术界最最有名的大师级人物，曾获图灵奖及其他无数科技奖项）的弟子Robert Sedgewick的名著C算法一书的配套源码-Kunth (computer science academic gurus of the most famous figures, won the Turing Award and countless other technology awards) Robert Sedgewick the disciples of the fam
fina_ver
- 用迷宫算法实现聚点的统计，这里只是简单扫描每个像素的四个方向，当然，可以很容易修改源码，实现八个方向的扫描，至于聚点嘛，就是被数码0包围的数码1组成的块，这种算法在元件识别方面可以应用。-maze algorithm used accumulation of statistics, here simply scanning each pixel of the four directions, of course, you can easily modify the source codes to
傅里叶级数逼近源码
- 傅立叶级数在数字信号处理中有非常重要的应用，这里提供了傅立叶级数在C环境下的源码及其应用，对于数据处理的工程人员大有裨益。-Fourier series in the digital signal processing is a very important application, it provides Fourier Series C environment in the source and application of data processing for the engineeri
编译原理中的slr算法
- Window 编程例子, 比较cool !-Window programming examples, cool!
SortTest
- 说明: 这一段在复习数据结构和算法，有一些零星笔记，在Others这个归类下，欢迎指正。 对于排序算法，想做一个动态演示的东东，因此今天使用VB.net大概实现了一个，界面如下，代码有2个版本，一个可以指示当前循环的位置（但设计感觉不好，也找不到更好的办法），一个没有。 -Note : This section of the review of data structure and algorithm, a few scattered notes, in the classified
difference
- 关于差分方程的一个程序，很简的二维椭圆方程，区域是1x1-differential equations on a procedure for the very simple two-dimensional elliptic equation, the region is 1x1