经典VC排序源代码，做成了win32界面形式,希望对大家用所帮助

student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧-student select course system, powerbuilder done, it is easy to realize that no one on the right is contained

利用三元组完成距阵的基本运算,包括加法,减法,乘法.数据结构实习题目-using ternary Group completed the basic matrix operations, including addition, subtraction, multiplication. Internship topic data structure

图论算法，旅行推销员问题，很有趣。 可算出图中的哈米尔顿回路-graph algorithm, traveling salesman problem, very interesting. Map can be calculated totally dominated the circuit

用四种方法实现对随机的10000个数的排序，并比较这四种方法性能的差异。-Four methods used to achieve the number 10000 on the random sequencing and comparing the differences in the performance of four methods.

应用背景在Windows和Linux Qt，我们可以访问 ；使用OCI数据库。用于编译，在窗口中。在项目属性页，库，包括设置，链接。如果Linux，在makefile  ； ；incpath，LIBS设置。例如：…incpath  ； ； ；= -我/选择/ qtsdk-2010.05 / QT / mkspecs / linux-g + + -。。/。/ 6410serverqt -我/选择/ qtsdk-2010.05/qt/include/qtcore -我/选择/ qtsdk-2010.05/qt/include/qtnetwork -我/选择/ qtsdk-2010.05/qt/include/qtgui - I /选择/ qtsdk-2010.05/qt/include - I.。/调试。。/。/ 6410serverqt -我美元（qtdir）/ mkspecs默认-。。/ generatedfiles - igeneratedfiles /调试- igeneratedfiles -我-我/ usr /包括/甲骨文/ 11.2/client…LIBS  ； ； ； ； ；= $（sublibs） ；- L /选择/ qtsdk-2010.05/qt/lib - lqtgui - L /选择/ qtsdk-2010.05/qt/lib - L / usr / X11R6 / lib - lqtnetwork - lqtcore - lpthread  ；- / Oracle 11g／L自民党-低密度脂蛋白- lnsl - lclntsh…关键技术在Windows和Linux Qt，我们可以访问 ；使用OCI数据库。登录的步骤是ocienvcreate， ； ；ocihandlealloc，ocilogon。执行步骤ocistmtprepare， ； ； ；ocistmtexecute，ocitranscommit。如果有参数，ocistmtprepare， ； ； ；ociattrget，ocib

UTE - (U)niversal ASP (T)able (E)ditor 万能数据管理（管理后台）-oldest- (U) niversal ASP (T) able (E) Editor omnipotent data management (management background)

PB的数据窗口中的内容经常要导出为excel,自带的函数效果总是不好,可以试试这个,表头也可导出.-PB data window to the often exported to excel, and built-in function is undesirable results, you can try this, the first table can be derived.

从fortran编译器生成的exe文件连接ORACLE DB的示例代码。本程序通过oracleserver8.05和9i测试，使用了一些表中的数据。需要Oracle TNS名称文件进行连接。

用VC++编写中值滤波的算法，具有图形界面-The algorithm of Filter ，which use VC++

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.