资源列表
Dynamic
- 使用动态规划解决背包问题，用C++语言实现-Knapsack problem using dynamic programming to solve, using C++ language
cPP
- 用面向过程程序设计方法编写一个计算面积的C语言程序。-use procedure-oriented programming approach write a c programming that calculate superficial
Algorithm-design
- 算法设计专题课件，其中包括各种目前流行的算法。-Algorithm design feature courseware, including a variety of popular algorithms.
Fib
- 算法分析基础——Fibonacci序列问题 分治法在数值问题中的应用——最近点对问题 减治法在组合问题中的应用——8枚硬币问题 变治法在排序问题中的应用——堆排序问题-The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on the issue by governing law in
diugidiaoyong
- 简单的递归调用示例，可以熟悉递归调用的功能。-Simple example of recursive calls can be familiar with recursive function calls.
paixu
- 很好用的排序的运用 c语言的示例 好好学习一下-Well with the sort of example of the use of c learn about the language
mofangzhen
- 魔方阵，其中每个元素值都不相等，且每行、每列以及主、副对角线上各n个元素之和都相等-Magic square, in which each element value is not equal, and every row, column and main and auxiliary diagonal elements of the n and are equal
C-PP-description
- 算法Ⅰ～Ⅳ（C++描述）：基础、数据结构、排序和搜索-Algorithm Ⅰ ~ Ⅳ (C++ descr iption): base, data structures, sorting and searching
31
- 二叉排序树的构建，采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Construction of binary sort tree, using llink-rlink stored binary sort tree, the preparation can be established through the keyboard input binary sort tree, and immediately in t
Number-of--Narcissus
- 其中，包含了水仙花数的遍历算法，以及相关的源程序，可以输出3到30位的水仙花数-his contains a number of traversal algorithm daffodils, and the related source code, you can output 3-30 Number of daffodils
C-experimentation
- (C)1.是能找出一串数中的最值，及其序号。（是选择排序法的基础） 2.对输入文本中的多个字符串排序（涉及字符串指针，指针数组，二维数组，三者综合应用） 3.选择排序法。-The C experimentation.
LCS
- 用C++实现最长公共子序列算法的程序清单-Using C++, the longest common subsequence algorithms Listing