Search - Make - CodeBus

Search - Make - List

[Data structs] 严蔚敏老师专贴 DL : 0: 严蔚敏老师的数据结构专贴。考研的朋友要好好看哦是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah
Date : 2025-12-16 Size : 822kb User : 李可
[Data structs] homework DL : 0: 数据结构是编程的基础，本例是本人写的八个基本数据结构的实现方法，用C语言编写，在VC中调试成功，并带有少量的注释，有兴趣的可以研究一下。我在里面尽量使用了指针-data structure is the basis for programming, which in this case is I wrote the eight basic data structure of the method, using C language, in VC debugging success, and with a small amount of the Notes may be interested in the study. I try to make full use of a guideline
Date : 2025-12-16 Size : 1.52mb User : zbjg
[Data structs] bc_mfc DL : 0: 使用Binomial Cofficient的演算法,並以Divide-and-Conquer以及Dynamic Programming的方式來實作,並以比例尺來做比較-use of the algorithms, and Divide- and-Conquer and Dynamic Programming is the way to make and do more to Scale
Date : 2025-12-16 Size : 16kb User : 阿哲
[Data structs] Visual_Cpp DL : 0: 最短路径查询,用的是ESRI公司arcobject组件开发的,已经作成dll,用起来非常的方便-Shortest Path inquiries, the company is ESRI arcobject development of the components, make dll with it is very convenient
Date : 2025-12-16 Size : 37kb User : 丁胜
[Data structs] 四级上机_30 DL : 0: 全国计算机等级考试四级上机的部分练习题，配有我自己写的算法，算法说明和输入输出文件，使实验起来更容易。算法比较简洁易懂，大概有三十题左右（已经去掉了重复和类似的），对考四级的朋友和正在学习C的朋友会有帮助的-National Computer Rank Examination four aircraft on the part Exercises, equipped with my own writing algorithm, the algorithm description and input and output documents, and make it easier to experiment. Algorithms easy to read, there are about 30 or so that (already removed the duplication and similar), the examination of the four friends are learning C and friends can be helpful
Date : 2025-12-16 Size : 10kb User : 沈毅
[Data structs] 通配符查找算法 DL : 0: 一个效率很高的通配符查找算法，适用于对"*"和“?”的通配符查找，可以根据需要进行修改，适用于不同应用，另外还有一个非常适用的CRC检查算法-a highly efficient wildcard search algorithm that applies to the "*" and "the" wildcard search, it may need to make changes apply to different applications, there is another very applicable CRC check algorithm
Date : 2025-12-16 Size : 2kb User : 军
[Data structs] Data Structures with C++ Using STL DL : 1: 这是数据结构和算法的国外经典书籍.清华大学出版社出版的<数据结构C++语言描述-应用模板库STL>陈君译英文名称是Data Structures with C++ Using STL. 作者: William Ford ,William Topp . 代码代码当中包含各种经典算法 ,比如各种排序如选择排序,基数排序,快速排序等等.还有各种其他经典算法,有 8皇后问题，汉烙塔 Hanoi ,约瑟肤等了。此原文件是我们学校的一个博士从国外带回的,花了80美元,请大家好好的利用好.-This the data structure and algorithm abroad classic books. Qinghua University Press published lt; C data structure description language-STLgt Application Template Library; Chen translation of the English name of the Data Structures Using C with STL. Author : William Ford, William countries. Source code which packets containing various classical algorithms such as various sequencing option, in order of ranking base, rapid sequencing etc.. there are various other classic algorithms, 8 Queens, tower-baked Hanoi, Joseph skin waiting. This original document was the one Dr. schools from abroad back to a cost of 80 US dollars, please make good use of good.
Date : 2025-12-16 Size : 3.37mb User : 冰舟
[Data structs] 国际大学生程序设计竞赛题解 DL : 0: 要想看看自己的编程水平有多高。除了开发项目和做出象样子的软件以外，还有一个很好的办法就是参加比赛.而国际大学生程序设计竞赛题解,为你提供了检验自己的一个很好的挑战。里面不仅有大量的例题,还有各种算法的分析和与实例的结合。是提高英文和编程能力的绝对好书了-To look at our own programming level is very high. In addition to development projects and to make the software look like the outside, there is a good way to participate in the competition. International Collegiate Programming Contest that solutions to provide you with a test of a good challenge. There is not only a large number of examples, there is a wide variety of algorithms and examples of the combination. Improving English and programming capabilities of the absolute best books
Date : 2025-12-16 Size : 1.79mb User : srgr
[Data structs] code3 DL : 0: C写的填充算法源码算法可是在编程中可是非常重要的大家可以参考一下这个代码，学习一下算法-C wrote filling algorithm source algorithm But in programming is very important but we can make reference to the code , and study how Algorithm
Date : 2025-12-16 Size : 40kb User : sdm68
[Data structs] code4 DL : 0: C写的裁剪算法源码算法可是在编程中可是非常重要的大家可以参考一下这个代码，学习一下算法-C was cut algorithm source algorithm But in programming is very important but we can make reference to the code, and study how Algorithm
Date : 2025-12-16 Size : 130kb User : sdm68
[Data structs] AVL_Lib DL : 0: Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.-Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in whic
Date : 2025-12-16 Size : 85kb User : 高名
[Data structs] accepted1 DL : 0: 解决时钟问题，acm竞赛题 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Date : 2025-12-16 Size : 1kb User : 王冠
[Data structs] elcshuiping DL : 0: 产生水平地震波的小程序，希望对作地震分析的同仁有用处！-level of seismic waves generated by small program, and I hope to make seismic analysis of the usefulness of us!
Date : 2025-12-16 Size : 6kb User : 小脚丫
[Data structs] 3SAT DL : 0: 对于给定的带权3-CNF，设计一个蒙特卡罗算法，使其权值之和尽可能大-regard to the right to bring 3-CNF, a Monte Carlo algorithm design, make it the right value and the greatest possible
Date : 2025-12-16 Size : 1kb User : 自由人
[Data structs] beibaowenti007 DL : 0: 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n)，使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the benefits should be. To make an optimal decision-making sequence Xi (i = 1 ~ n), and makes the ultimate effectiveness of the largest.
Date : 2025-12-16 Size : 9kb User :
[Data structs] Dynamic_Programming DL : 0: 多阶段决策过程（ multistep decision process ）是指这样一类特殊的活动过程，过程可以按时间顺序分解成若干个相互联系的阶段，在每一个阶段都需要做出决策，全部过程的决策是一个决策序列。动态规划（ dynamic programming ）算法是解决多阶段决策过程最优化问题的一种常用方法，难度比较大，技巧性也很强。利用动态规划算法，可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是：将待求解的问题分解成若干个相互联系的子问题，先求解子问题，然后从这些子问题的解得到原问题的解；对于重复出现的子问题，只在第一次遇到的时候对它进行求解，并把答案保存起来，让以后再次遇到时直接引用答案，不必重新求解。动态规划算法将问题的解决方案视为一系列决策的结果，与贪婪算法不同的是，在贪婪算法中，每采用一次贪婪准则，便做出一个不可撤回的决策；而在动态规划算法中，还要考察每个最优决策序列中是否包含一个最优决策子序列，即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Date : 2025-12-16 Size : 3kb User : 汤烈
[Data structs] PackageProblem DL : 0: 实现背包问题 package problem 1．问题描述假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2）、（1，4，5）、（8，2）、（3，5，2）。 2．基本要求读入T、n、w1 , w2 , … , wn 3．提示：可利用递归方法：若选中w1 则问题变成在w2 , … , wn 中挑选若干件使得其重量之和为T- w1 ，若不选中w1，则问题变成在w2 , … , wn 中挑选若干件使得其重量之和为T 。依次类推。也可利用回溯法的设计思想来解决背包问题。首先将物品排成一列，然后顺序选取物品装入背包，假设已选取了前i 件物品之后背包还没有装满，则继续选取第i+1件物品，若该件物品“太大”不能装入，则弃之而继续选取下一件，直至背包装满为止。但如果在剩余的物品中找不到合适的物品以填满背包，则说明“刚刚”装入背包的那件物品“不合适”，应将它取出“弃之一边”，继续再从“它之后”的物品中选取，如此重复，，直至求得满足条件的解，或者无解。注：没压缩密码-knapsack problem achieve a package problem. Problem description one would assume that the total volume of loaded backpack and T n size pieces of w1, w2, ..., wn items Can n items from the selected pieces were just filled with backpacks, even w1 w2 ... wn = T, asked to identify all of the above conditions are met solution. For example : when T = 10, the volume of items (1,8,4,3,5,2), may find the following four solutions : (1,4,3,2), (1,4,5), (8,2), (3,5,2). 2. Basic requirements read T, n, w1, w2, ..., wn 3. Tip : Recursive methods can be used : If the problem were selected w1 into the w2, ..., wn selected several pieces make its weight and as a T-w1, if selected w1, w2 issue into the .... wn selected several pieces make its weight and as T. Renumbered accordingly. Retrospective can also u
Date : 2025-12-16 Size : 9kb User : 李昭明
[Data structs] TriMat DL : 0: 在目录“\上三角矩阵类的实现”中给定了文件triMat.cpp、triMat.h，请把triMat.h文件中的9个填空位置补上正确的代码，使triMat.cpp能完成上三角矩阵的加、减、乘运算。要求输入：输入矩阵维数：4 输入矩阵a的元素（包括0）： 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1 输入矩阵b的元素（包括0）： 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1 -in the directory "\ triangular matrices on the achievement," given the document triMat.cpp. triMat.h invited to triMat.h documents fill up the nine positions make up the correct code, so triMat.cpp complete triangular matrix on the addition, subtraction, multiplication. Importation : input matrix dimension : a four input matrix elements (including 0) : 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1 b of the input matrix elements (including 0) : 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1
Date : 2025-12-16 Size : 572kb User : 李昭明
[Data structs] ppmd_src DL : 0: 一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究.-a compression algorithm, named PPMD, higher compression ratio, and can make its own decisions and build, please algorithm research colleagues to study together.
Date : 2025-12-16 Size : 12kb User : 丁国银
[Data structs] Generic_Pool_demo DL : 0: Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So ju st take the IMAP connection pool and convert tha t to a pool of threads (Copy, paste, find, replace). Need to make some changes to the pool i mplementation Not a very easy task, since the code has been duplicated in many place s. Re-inventing source code is not an intellige nt approach in an object oriented environment w hich encourages re-usability. It seems to make more sense to implement a pool that can contain a ny arbitrary type rather than duplicating code . How does one do that The answer is to use t
Date : 2025-12-16 Size : 170kb User : zhuxin

« 12 3 4 5 6 7 8 9 10 ... 13 »