资源列表
mergesort
- 用C++实现在数据的输入，并通过输入要查找的数据的值返回所查找的数据所在数组中的位置-In c++ to realize the data input, and through the input data to find the value of the return to find the position of the array of data
4.6
- 用C++实现的。给线性表添加一个成员函数，倒置线性表中元素的顺序。对于n个元素的线性表，算法的时间代价为n.-With c++ implementation. Linear table to add a member function, the order of the elements in a linear inversion table. For the linear table of n elements, the algorithm of time cost for n.
dbscan_homework
- dbscan算法，数据挖掘期末作业。用matlab编写。自己是一份报告。内含全部代码。测试可以使用。-dbscan algorithms, data mining final assignment. Written in matlab. It is a report. Contains all the code. Test can be used.
Observer
- a observer pattern desing example in c++ a basic class room one
MatrixChain
- 实验二-矩阵链乘 Descr iption 给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。 你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。 例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。-MatrixChain dp
Source1
- change hb matrix to csc matrix
C_A-topological-sort
- 用C写的，输入一张图的顶点和入度，得出顶点的拓扑排序-Written in C, the degree of input into the vertex and a graph, draw the vertices of topological sorting
C_The-critical-path
- 用C写的，求顶点事件的最早发生时间和顶点最晚发生时间 -Written in C, find the earliest time events vertex and vertex latest time occurred
C_one-yuan-polynomial-multiplication
- 这是用C写的一元多项式乘法，输入系数和指数，得到结果的系数和指数-It is written in C one yuan polynomial multiplication, input factors and indices to obtain the results of coefficients and indices
Deep-traversal-list
- 用C写的链表深度遍历，输入一张表的顶点等相关信息，得到该图的深度遍历-Written in C depth traversal list, enter a list of vertices and other relevant information, to give depth to traverse the graph
List-the-breadth-traversal
- 用C写的链表广度遍历，输入一张图的相关信息，得到该图的广度遍历-Written in C chain breadth traversal, enter a map-related information, to give breadth to traverse the graph
HuffmanTree
- 哈夫曼树的基本构建以及哈夫曼树构建成功的基本举例-The basic building Huffman trees and Huffman basic building a successful example