资源列表
Greedy_DelleteNumber
- using greedy tratage to solve the problem of Number Delete.
b
- 用c++写的回文判断 用两 个栈实现的 一个用于辅助
Firc
- 用C语言实现的fir滤波器的程序，经过验证可以运行-Using C language to achieve the fir filter procedure, after verification can run
DijkstrasAlgo
- Djkstra Shortest path algorthm
HuffumanCode.cpp
- 用C语言简单的实现数据结构里面的哈弗曼编码-Data structures inside the Havermann coding
shushuzhuang
- 打印树状二叉树，用队列，按层次打印 按先序遍历和中序遍历建立二叉树-Print the tree binary tree, with a queue, by level of print by the first order traversal and inorder traversal binary tree set up
main
- 完成了简单的A*（A star）算法 可以用于求解第K短路径-Completion of a simple A* (A star) algorithm can be used to solve the first K shortest paths
Binary-search
- 折半查找。具体是对程序中查找功能的修正，使其效率增加。-Binary search. Is a program to find the specific features of the amendment, to increase its efficiency.
main
- 递归实现八皇后问题,输出以0和1组成的数组组成。分页显示结果。-eight queens.
ss
- 非递归合并排序，用stack实现的。包含一个test.h头文件-Non-recursive merge sort and stack. Contains a test.h header file
CS_OMP
- 1-D信号压缩传感的实现(正交匹配追踪法Orthogonal Matching Pursuit)-Orthogonal Matching Pursuit
Screening-find-prime-numbers
- 除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的 求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质 数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast Fi