约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。...

vc下的ADO数据库编程-vc the ADO database programming

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

C++数据结构图结构的类定义及有关算法-C data structure definition of the class structure and the algorithm

这个算法，是用来设置密码的，有数据结构中的栈来实现的。-The algorithm is used to set up passwords, and data structure of the stack to achieve.

系统主要由考勤机和考勤软件两部分组成，考勤机集成了发卡机、读写器、和数据传输卡，可以脱离微机单独使用，其大容量、高可靠性的存储能力，足以应付人数众多的单位使用；高度集成、功能强大的考勤软件让原本枯燥、繁琐的考勤管理变得轻松、愉快 -System primarily by attendance and attendance software is composed of two parts, attendance card issuing machine integrates machine, reader, and data cards from the computer can be used independently, its large capacity, high reliability, storage capacity, sufficient to meet the large number of the use of the units highly integrated and powerful time and attendance software allows the original boring, tedious attendance management becomes easy, pleasant

JSP+Postgre+servlet MVC架构... 网上图书馆系统原代码. CMU课程实践课程 -JSP servlet Postgre MVC framework ... online library system source code. CMU Practice courses

一个客户管理的源代码，采用三层式结构设计。-Management of a client

Shot 26102 I_plasma. Disruption

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

数据结构 基础要好-better data structure foundation