资源列表
divid-element-choose
- 算法练习：分治法实现元素选择，附有详细说明、解释。-Algorithms Exercise: Divide and Conquer element selection with detailed instructions, explain.
bitree
- 二叉树基本功能的实现，包括建立，先序遍历，中序遍历，后续遍历-about bitree function
Insertion-and-deletion
- 顺序表的插入和删除，虽然有点简单。但是，成功的运用c语言的基本的知识。-Insertion and deletion of the sequence table, though a bit simple. However, successful use of basic knowledge of C language.
Generic_Pool_demo
- Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grow
2533
- poj 2533 Longest Ordered Subsequence 简单的动态规划题目-poj 2533 Longest Ordered Subsequence simple dynamic programming topics
findmax
- 算法设计，递归算法设计，寻找多数元素，设置监视器多数元素的出现-Algorithm design, recursive algorithm design, look for most elements,
chess
- 在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. -In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.
mian
- 幻方矩阵 问题描述： 幻方是一种很有意思的数字矩阵，在很早著名的九宫八卦阵就与幻方有关。 幻方的定义为： 1 到 N*N 的整数填入N*N的方格中，每行和每列以及对角线的数字之和必须是相等的。 你作为八卦公司的顶级程序员，现在需要你解决一个问题，将任意奇数阶的幻方找出来。 输入： 输入包括多个测试集，每行为一个正奇数N(1 <= N < 1000)，0作为输入的结束且不需要处理。 输出： 对于输入的每一个N， 输出一个它所对应的N阶幻方，如果存在
fento3
- 用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing
算法zxm
- 前一阵出去玩了，补回还差的2个，里面包括上次上载的一共5个，另加个汇编程序，是课堂实验-play out a little while ago, to compensate for the worse two, including the inside on the last of a total of five, plus a 000 assembler, a classroom experiment
yuesefu
- 约瑟夫生死游戏功能齐全完整的源代码加课程设计-Joseph life and death game featured the complete source code plus curriculum design
MULTI
- 利用链表实现一元多项式相乘。数据结构习题之一。-List the realization of one dollar to use polynomial multiplication. Exercise one of the data structure.