language data structure outlined

INFORMIX数据库优化SHELL，可以一目了然地发现数据库中的性能问题。-shell form informix ,can find question of databases

C#中，应用程序与数据库access的链接解释-C#, applications and database access links to explain the

求最短路径，基于VISUAL C++开发的源代码 属于数据结构-Seek the shortest path, based on the VISUAL C++ Developed source code belonging to the data structure

使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task

对文本文件进行huffman编码，并显示huffman树-to the text document for Huffman coding, and that Huffman tree

哈夫曼树的建立,haffman 编码,在turbo c 下运行-Huffman Tree, haffman encoding, turbo c in the run

SQLite的c++封装类,包括.net封装-SQLite c Packaging categories, including. Net Packaging

物业缴费管理系统-property Payment Management System

用java语言实现策略模式 BubbleSort.java――冒泡排序算法 ChooseSort.java――选择排序算法 InsertSort.java――插入排序算法 MergeSort.java――合并排序算法 SortStrategy.java――排序算法的接口 Sort.java――排序类，通过此类的sort()可以对实现了Comparable接口的数组进行升序 SortMain.java――显示界面排序-Using java language model to achieve the strategy BubbleSort.java-- Bubble Sort algorithm ChooseSort.java-- choice of sorting algorithm InsertSort.java-- Insertion Sort algorithm MergeSort.java-- merge sorting algorithm SortStrategy.java-- sort of the interface algorithm Sort. java- Sort category by such sort () can be achieved for an array of Comparable interface ascending SortMain.java-- Display order

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.