资源列表
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
LEAST-SQUARE-BASED-svd
- 基于l1,l2 NORM 的最小二乘法，岭回归等算法，懂的人一看就知道好用，利用SVD进行计算的-Based on L2, NORM L1 least square method, ridge regression and other algorithms, the people who understand the good use, the use of SVD for calculation
Dijistra
- Difistra 算法的 C++实现,简单，快速-Difistra algorithm with C++
Problem-Arrangement-zoj-3777
- zoj 3777，是我acm人生中的第一题状压dp，不得不承认这题很好，经典入门题。-zoj 3777, my first question acm life-like pressure dp, had to admit that this question is very good, classic entry title.
BinarySortTree
- 二叉搜索树类的c++实现，实现建立树，插入，删除，查找等操作。它或者是一棵空树，或者是具有下列性质的二叉树： 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值； 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值； 它的左、右子树也分别为二叉排序树。-Binary search tree c++ implementation, to achieve the establishment of tree, insert, delete, search and other ope
BInsertSort
- 折半插入排序在查找记录插入位置时，采用折半查找算法 折半查找比顺序查找快, 所以折半插入排序在查找上性能比直接插入排序好 -Binary insertion sort to find records insertion position, using a binary search binary search algorithm is faster than the sequential search, binary insertion sort on so look better pe
QuickSort
- 任取待排序记录序列中的某个记录(例如取第一个记录)作为基准(枢),按照该记录的关键字大小,将整个记录序列划分为左右两个子序列: 左侧子序列中所有记录的关键字都小于或等于基准记录的关键字 右侧子序列中所有记录的关键字都大于基准记录的关键字 -Take any sequence of records to be sorted in a record (for example, take the first record) as a reference (pivot), in accor
ShellSort
- 首先取一个整数 gap < n(待排序记录数) 作为间隔, 将全部记录分为 gap 个子序列, 所有距离为 gap 的记录放在同一个子序列中 在每一个子序列中分别施行直接插入排序。 然后缩小间隔 gap, 例如取 gap = gap/2 重复上述的子序列划分和排序工作，直到最后取gap = 1, 将所有记录放在同一个序列中排序为止-First, take an integer gap < n (the number of records to be sorted) as t
Find
- 一些经典查找算法的介绍与实现，介绍其数据结构可以更好地了解这些查找算法。-Find some classic introduction and implementation of the algorithm, it introduces its data structure can better understand these search algorithm.