资源列表
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
shiyanliu
- 假设有一个数据类型为整型的一维数组A，A 中的数据元素呈无序状态，编写一个采用堆排序法将A中的数据元素按由小到大进行排序的程序。-Suppose a data type for the integer one-dimensional array A, A in the data element was disorder, to write a heap sort method used in the data elements A sort of process by small to larg
the_longest_rising_qeue
- 在一串整数列中找出最长增子序列，并输出其长度。所谓最长增子序列，如13752的最长增子序列为137或135.-find out the longest queue whose items are from the original queue and trend is rising. Put out its length.
Binary-Tree(new)
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
prime_1
- 利用C++实现的普瑞米尔算法结构~构件最低端路径~-Using C++ implementation Puri Kashmir algorithm structure ~ component is the most low-end path ~
syslin
- un fichier pour résoudre un système linéaire par matlab
LS_frq_HW2
- Frequncy leadsquar LS
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
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.