一个通讯录――――――利用C++实现的，非常不错哦

关于三层架构的内容参考，三层架构的大致结构内容-With regard to the contents of the reference three-tier architecture

C++ Builder程序员学习数据结构第4章-Builder C programmers to learn data structure Chapter 4

h3h3h3面并不很精通。我最近看的书《分行与小波》《小波十讲》《小波变换与分数傅里叶变换》《工程小波变换》等。上面所写，一部分来源于书，一部分来源于自己的体会。所以希望-h3h3h3 surface is not very proficient. I recently read "branch and wavelet" "wavelet 10 stresses" "wavelet transform and scores of Fourier transform," "project wavelet transform." The above was written part from the book, from the part of his experience. I hope

一个作的很好的dao数据库开发，值得一看。-one for the good dao database development overseas.

计算机编程艺术第二卷，学习数据结构与算法的好书，喜欢的朋友可以-Art of Computer Programming Volume II, learning data structures and algorithms books, like friends can

FastDb是高效的内存数据库系统，具备实时能力及便利的C++接口。FastDB不支持client-server架构因而所有使用FastDB的应用程序必须运行在同一主机上。FastDB针对应用程序通过控制读访问模式作了优化。-FastDb is efficient memory database systems, with real-time capability and convenience of the C interface. FastDB not support client-server structure which all use of the application process FastDB Order must be running in the same host. FastDB against applications by controlling access mode was reading optimization.

它是一所大学 DSA 管理数据库的一个项目，DSA 意味着学生事务部...在这里工作上 C#、 vhdvlhjchxbcxjbcxbxcnbxcnb nxcb nxcnjbkjdbcjcxxcjkbkxcjbvkjvbxjbvjxbvhfufhisudhfkjdcnkxznknkzxjn bmnm 锰、 zmnckznkzcjsiodcjsdijcknk kn knknckdcnkdnknckcsdkjcknczknzknlzmlmzlmzlmlz kxjcnkjvkjvnxjnkxnkxn kjnkjxn kjnj nkxjxjkjcjcjjcjcjcj nnn nn nn nnn nnn nnn nlkzxlklzkxlkxlzkxlzkxlxklzkxxlklzklxzkj jnjncnjnnlmlkkkxlzklzkclzklzxkijfivj jnjnjnjn n nnn 毫米、 xmc、 厘米、 c、 kjnkncnxkcnvkfvfjfkjvklfjlkfdjvlkfdjfvkf

六级单词数据库编程，压缩包中已带数据库 数据库使用的是Acce-six words database programming, which has been compressed with the use of the database is the database Acce

数据结构中的链表类实现多项式的相加 用C++实现!-Linked list data structure in the sum of polynomial-type implementation with C++ implementation!

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting