Qt xml解析

用ODBC对数据库实现连接 显示数据 修改数据-Using ODBC to connect to the database display data modification of data

主分量变换，不要密码。-PCA transform, not passwords.

内存池，如果需要减少长时间、不断开辟小内存的程序产生的内存碎片对程序运行效率的影响，可以使用该类库；-Memory pool, if the need to reduce the time, and constantly open up a small memory memory fragmentation procedures of the process the impact of operating efficiency, you can use the class library

在各种各样的搜索算法中，AVL树的搜索算法可以将其最短的搜索时间做一个保证，本程序就是实现了AVL搜索算法-in a wide variety of search algorithm, AVL tree search algorithms can be the shortest time to do a search that The procedure is to achieve the AVL Search Algorithm

分布式数据库系统 清华大学研究生课程讲义、课件等相关资料-Distributed Database System, Tsinghua University graduate student lecture courses, courseware and other related information

此为Delphi树控件的一个数据库运用-this tree controls for the use of a database

字符串扩展问题的递归算法及动态规划算法的详细分析及实现-implementation and detailed analysis of recursive algorithm and dynamic programming algorithm of string expansion issue

两列双向链表相同值查询设计： 实现内容：构建两个双向链表，能够根据第一个链表中的值查询在第二个链表中的相同值的位置-2 bi-directional value chain the same query design: the realization of content: To construct two two-way linked list, according to the first list of values query in the second list value in the same position

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree