资源列表
lsm
- 最小二乘一次完成算法及其matlab实现-Least squares method, matlab
quick
- quick sort is the most popular sorting algorithm. Its virtue is that it sorts in-place (even though it s a recursive algorithm) and that it usually is very fast. On reason for its speed is that its inner loop is very short and can be optimized very w
SELECTION
- selection sort algorithm in C
ertexe
- thisisaanother erettt exaple
Binary-Tree(new)
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
prime_1
- 利用C++实现的普瑞米尔算法结构~构件最低端路径~-Using C++ implementation Puri Kashmir algorithm structure ~ component is the most low-end path ~
1088
- 编程求出1^M+2^M+3^M+...+N^M的近似值(1<=N<=10000000,1<=M<=20) Time Limit: 2000MS Memory Limit: 65536KB 方法：利用伯努利数推导公式求解-The programming 1 ^ M+2 ^ M+3 ^ M+ ...+N ^ M approximation is obtained (1 < = N < = 10000000,1 < = M < = 20) Tim
new-Bubble-Sort
- 修改起泡排序的算法，在正反两个方向交替进行扫描，即第一趟把排序码最大的对象放到序列的最后，第二趟把排序码最小的对象放到序列的最前面。如此反复进行。-Modified bubble sort algorithm, in both directions alternately scanning, sorting code that first trip to the largest objects into the final, the second trip to the smallest obj
lianshou
- 有15个人围成一圈，顺序从1到15编号。从第一个人开始报数，凡报到n的人退出圈子。用C语言写出程序，输入n(n>=1)的值，输出最后留在圈子里的人的编号 -Have 15 people in a circle, the order number from 1 to 15.Starting from the first person counted off people who report to n out of circle.Using C language to write the p
HermitePoly
- MATLAB 源码 一个HermitePoly的例子 可以运行的-MATLAB source code examples can run a HermitePoly
delete-linked-list-node
- 该源码用c语言编写，可以删除链表中的结点，是数据结构中链表删除的一种基础练习程序，简单易懂。-The source code in C language, you can delete the linked list of nodes, is a basic delete list data structure in the exercise program, easy to understand.
BiTree
- 给定前序遍历和后序遍历的顺序，要求出总共有多少棵不同形态的二叉树满足这样的遍历顺序。-To order preorder and postorder before setting requires the total number of trees of different forms of binary tree traversal order to meet this.