jiaotongzixun

希尔排序，希尔排序，希尔排序，希尔排序，c语言(shell sort)

各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)

说明：  贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)

本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。 本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)

选择型结构c语言编程 (Choose the type of structure of C language programming)

二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)

C++实现的两类问题随机森林生成算法，对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)

二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)