对内存内连续区域的数据进行排序，排序采用了交换排序的方法...

智能仓库管理系统-intelligent warehouse management system

实验说明   实验所用英文文本为 /HaffmanfT 下的a.txt文件，原文为： South Korea’s top court ruled on Thursday that Japan’s Mitsubishi Heavy Industries Ltd must compensate 28 South Koreans for their forced labor during World War Two, a ruling that drew an immediate rebuke from Tokyo. The decision echoed the Supreme Court’s landmark verdict last month that ruled in favor of South Koreans seeking compensation from Japan’s Nippon Steel & Sumitomo Metal Corp. for their wartime forced labor. The court upheld a 2013 appeals court decision that Mitsubishi must pay 80 million won ($71,000) to each of the 23 plaintiffs in compensation. In a separate

ubudjet est 联合国 logiciel 德管理学院杜预算人员 管理学院院 déponses par

Town是一个100% 纯Java API，它位于JDBC API的顶部。这个API的目的是简化和一个JDBC兼容的关系数据库的交互。通过使用Town,可以执行和管理select/insert/update/delete　SQL语句，而不用真正写一行SQL。Town也可以使用任何JDBC连接字符串和内部连接池。-Town is 100% pure Java API, it is located JDBC API the crown. This API goal is the simplification and a JDBC compatible relational database interactive. Through uses Town, may carry out and manage select/insert/update/delete the SQL sentence, but does not need truly to write line of SQL. Town also may use any JDBC to connect the character string and internal connection pond.

在地理信息系统概率中，知道一个数据表，用编程的方法求它们的MORDAN码值-Geographic Information System in the probability of that a data table, using the method of programming for the value of their code MORDAN

class pour activation des formes géométriques triangulaires et rectangulaires

xml数据库，实现查插删改，JAVA SWING作界面-xml database, interpolation search for Modifications to realize, JAVA SWING for interface

程序存储问题:设有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

数据库VFP编程模块-Database Programming Module

面试经常遇到的大数相乘问题，代码简洁易懂-Interviews are often encountered in large numbers multiply problems, the code easier to understand