资源列表
kmp_suanfa
- KMP模式匹配算法,实现了用KMP算法无回溯查找字符串的功能
用分治法求第k小元素
- 用分治法求第k小元素 输入：程序从标准输入读入数据，第一行是一个整数n (1=<n<=100000)表示元素的个数，接下来的n行中每行有一个整数。最后一行是k，就是我们要找的第k小元素。 输出：针对每一组输入，输出一个结果，每个结果占一行。 例如： 输入 5↵ 123↵ 12↵ 1↵ 3↵ 4↵ 4↵ 输出： 12 ,Separation method using the first k elements in small
convexhull
- convexik jan convexik
machogfl
- 用途：用Cholesky分解法解方程组Ax=b 可利用该算法源码解求方程- Usage: The Cholesky decomposition solution of equations Ax = b can make use of the algorithm source solution of Equation
rect_multi
- 实现两个矩阵相乘的函数，重在学习用多维数组作为实参数时，形参该如何表达-Achievement of the two matrix multiplication function, focusing on learning to use multi-dimensional array as a real parameter, the parameter to express
yanghuisanjiao
- 杨辉三角的算法还有yanghuisanjiao杨辉三角的程序设计-visual basic
shhipinkongzhi
- opencv中用来添加滚动条到基本浏览窗口的程序-opencv used to add scroll bars to browse the window procedure for the basic
number3
- 利用C语言写的求三对角方程组Tx=f的解，并将解输出-Written in C language requirements tridiagonal equations solution of Tx = f
btree
- 该文件描述了如何根据一个已知序列建立二叉树。-build tree.
Dijkstra
- 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path a
qipao
- 冒泡排序法，分别采用最大数下沉、最小数上升两种方法进行对比排序-Bubble sort method, were used to the maximum number of sinking, the smallest increase in two ways to sort the number of
xinashi
- 基于openv实现图像载入并获取图像的像素-Based on openv realizes image load and get the image in pixels