This file were downloaded from the Programmers Heaven CD

设计要求： 出于不同目的的旅客对交通工具有不同的要求.例如,因公出差的旅客希望在旅途中的时间尽可能短,出门旅游的游客则期望旅费尽可能省,而老年旅客则要求中转次数最少.编制一个全国城市间的交通咨询程序,为旅客提供两种或三种最优决策的交通咨询. //请保留此信息，谢谢 1.需求分析: (1)提供对城市信息进行编辑(如添加或删除)的功能. (2)城市之间有两种交通工具:火车和飞机.提供对列车时刻表和飞机航班进行编辑(增设或删除)的功能. (3)提供两种最优决策:最快到达或最省钱到达.全程只考虑一种交通工具. -design requirements : For different purposes to transport passengers have different requirements. For example, on official business travelers in the journey time as short as possible away tourists expect possible travel provinces, and elderly passengers asked the least number of transit. establishment of a national inter-city traffic advisory proceedings, for the visitors two or three best decision of the Transport Advisory.// Please keep this information, I would like to thank one. demand analysis : (1) to provide information on the city for editing (such as add or delete) function. (2) Town between the two modes : Train and aircraft. Schedules for the train and flights for editing (created or deleted) function. (3)

cdecl函数调用，了解printf这样的函数调用，对比stdcall会更清楚。-cdecl function call, to understand such a function call printf, compared stdcall will be clearer.

win32 汇编教程。全面介绍windows环境下，汇编语言的编程教学。-win32 compilation of tutorials. Comprehensive introduction windows environment, assembly language programming teaching.

一个很好的汇编集成开发环境，支持多种汇编编译器。-A good assembly language IDE which support most assemblers.

停车场管理系统 数据结构栈的应用，希望对大家有所帮助！-C

脑电信号的分析算法的全面概述,包含李氏指数复杂度等-EEG analysis algorithm overview, including complexity, such as Lyapunov exponent

实现账号输入时信息，输入账号和密码，图形显示-Input to achieve account information, enter the account number and password, and graphical display

键盘中断程序 INT16-键盘中断程序

清理垃圾，大家可以下载到机子，可以帮助你清理机子垃圾-Cleaning up litter and everyone can be downloaded to the machine, I can help you clean up garbage loom

非递归的快速排序算法-#include #include #define MAX_SIZE 11 using namespace std typedef int elem typedef std::stack Stack int partition(elem*pData, int low, int high) void swap(elem& a, elem& b) void qsort(elem* pData, int low, int high) int partition(elem*pData, int low, int high) { elem key = pData[low] while(low < high) { while(low < high && pData[high] >= key) high-- swap(pData[low], pData[high]) while(low < high && pData[low]