C++Library

ubuntu系统性能优化简单教程 关闭最小化动画 长期使用 Ubuntu 后有一种感觉，那就是在 GNOME 中启动应用程序时，速度越来越慢。在 Ubuntu 英文论坛那边看到一个技巧，可以对这个问题起到改善作用。打开 /etc/hosts 文件，可以看到类似下面的内容： 。。。。。。。。。。。。(Ubuntu system performance optimization simple tutorial Close minimize animation After long-term use of Ubuntu, it is a kind of feeling in the GNOME started in the application, the more and more slow. In English BBS there see a Ubuntu on this problem technique that can play improved. Open/etc/hosts file, can see similar the following content: )

GEF中文教程书籍源码.这个是第6章的代码。(GEF Chinese tutorial source books and this is the code in Chapter 6.)

中小学教学资料1000篇(pdf)主要针对教师的教学经验、工作总结和相关教学的论文。(Teaching and learning materials in primary and secondary schools 1000 (pdf) mainly for teachers of teaching experience, and summing up the work of teaching and related papers.)

文中讲述了x86计算机的工作原理，设计与实现。(This paper describes the working principle of x86 computers, design and implementation.)

iso14443的相关信息介绍。适合入门的朋友。(ISO14443 introduce the relevant information. Suitable for entry-friend.)

说明：  OMNeT++是一款面向对象的离散事件网络模拟器，详细介绍了omnet++网络仿真模拟平台。(OMNeT++ is an object-oriented discrete event network simulator. The omnet++ network simulation platform is introduced in detail.)

C++高级参考手册，对C++新学者有帮助！(C++ High reference manual, the C++ New scholars help!)

单片机的毕业论文的外文翻译，字数3000左右，希望对大家有所帮助。(SCM dissertation foreign language translation, 3000 words , we want to help everyone.)

clojure实战,文字版本的pdf,非常好的电子书(the clojure actual text version pdf, a very good book)

说明：  本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。 本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems. This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.)