MFC-Sample

用C++实现了梯度下降求多元函数极值的算法,有可能会陷入局部最优解()

tsai C++实现,tsai C++实现 tsai C++实现 (Tiberius C realized, Tiberius achieve Tiberius C C C achieve Tiberius achieve realization Tiberius C)

此程序用来备份服务器上的文件夹访问权限。(the procedure used to the backup server folder permissions.)

32位操作系统OS/2的MPEG播放机，属于嵌入式领域。(32-bit operating system OS/2)

说明：  C sharp程式. 可自動排列撲克牌順序,並比大小.(C sharp code. Can be automatically arranged in order of playing cards, and more than size.)

VB6 源码实时监测局域网计算机的连接状态 (VB6 LAN connection status of the computer s real-time monitoring)

Heat lost from a pipe located indoor. Several Excel functions included.

VC编程封装ADO类 VC中利用ADO共同实现数据库的操作 在VC中使用ADO开发数据库应用程序 用C++访问SQLServer2000的实例(VC ADO programming package type VC ADO common database operations using the VC ADO database application development using C visit examples of CRM)

说明：  医院管理系统，是课程设计的一个小系统，大家看看(Hospital Management System, is a small system, curriculum design, we take a look at)

设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)