AdminTest

用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包，支持VISUAL C++和DELPHI/C++ BUILDER，需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)

说明：  实现了很多的数据结构算法，适合与想学习数据结构编程的读者。(achieve a lot of data structure algorithms, fit and want to learn data structure programming readers.)

对于给定的两个线段，程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)

自己写的一个检测某个程序是否运行来改变系统分辨率的控制台程序(Writing own a Detect whether a program is running to change the system console resolution procedures)

使用哈弗曼编码技术进行数据压缩和解压缩，缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)

上传程序用于解析Novatel输出range 信息，解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)

基于Visual C++ 的win32控制台的程序，实现使用定时器的功能，(Visual C++ win32 console-based program, using the timer function,)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)