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.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
解决时钟问题，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.
标签： 时钟
上传时间： 2015-05-21
上传用户：rishian
这是我的课程设计 由于时间有限，程序难免有不足。 还请多多指教。 程序建议不要在win2000和win xp的cmd下运行。 推荐在win98或纯dos中装有UCDOS中文DOS平台下运行。 主菜单程序为main.c 运行此程序，选择相应的菜单，即可运行查看到其他程序。 wnl.c万年历 adstd.c 学生数据库 ply.c小蜜蜂（UFO）游戏 tlife 生存模拟 但是要求main.c和其他程序的执行文件必须在同一目录里（文件夹）。否则连接其他程序将失败。 建议直接运行我已经编译好的执行文件(在ok目录下)运行main.exe即可通过菜单对四个程序进行调用。 如果发现不能正常使用本程序，请与我联系。 寝室电话:0732-8370551 7324474 QQ176141729 email:coynnbai@163.com 学生：陈欢 班级：03级计算机6班
标签：
上传时间： 2014-01-27
上传用户：wuyuying
这是sun公司的程序员考试书籍（英文版的pdf） 还有模拟考试安装盘，和视频！我将稍后发布！ READ THIS AGREEMENT CAREFULLY. IF YOU AGREE TO ALL THE TERMS AND CONDITIONS SET FORTH BELOW AND ARE WILLING TO BE LEGALLY BOUND BY THEM, PRESS THE I AGREE BUTTON TO CONTINUE WITH THE SETUP. IF YOU DO NOT AGREE TO SUCH TERMS AND CONDITIONS, PRESS THE I DON T AGREE BUTTON TO ABORT THE INSTALLATION.
上传时间： 2015-05-25
上传用户：ccclll
This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nested dissection orderings and it has some sample meshes and mesh generators. The toolbox contains a Matlab interface to Leland and Hendrickson s Chaco partitioning package, but it doesn t contain Chaco itself. The file "chaco/README" tells how to install the interface to Chaco. It also contains a Matlab interface to Karypis et al. s Metis partitioning package, using Robert Bridson s "metismex" code.
标签： partitioning including contains toolbox
上传时间： 2015-05-25
上传用户：tzl1975
MFC Black Book Introduction: Are you an MFC programmer? Good. There are two types of MFC programmers. What kind are you? The first kind are the good programmers who write programs that conform to the way MFC wants you to do things. The second bunch are wild-eyed anarchists who insist on getting things done their way. Me, I’m in the second group. If you are in the same boat (or would like to be) this book is for you. This book won’t teach you MFC—not in the traditional sense. You should pick it up with a good understanding of basic MFC programming and a desire to do things differently. This isn’t a Scribble tutorial (although I will review some fundamentals in the first chapter). You will learn how to wring every drop from your MFC programs. You’ll discover how to use, abuse, and abandon the document/view architecture. If you’ve ever wanted custom archives, you’ll find that, too.
标签： MFC Introduction programmer programme
上传时间： 2015-05-30
上传用户：youke111
附有本人超级详细解释（看不懂的面壁十天！） 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D．L．Shell于1959年提出而得名。它又称“缩小增量分类法”，在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序；然后，取第二个增量d2<d1重复上述的分组和排序，直至所取的增量dt=1(dt<dt-l<…<d2<d1)，即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。 三、算法设计: 1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中，逐次减小这个增量，最后当h减到1时，进行一次插入排序，排序就完成。增量序列一般采用：dlta[k]=2t-k+1-1,其中t为排序趟数，1≤k≤t≤[log2 (n+1)]，其中n为待排序序列的长度。按增量序列dlta[0..t-1]。 2、按增量dlta[k]（1≤k≤t≤[log2 (n+1)]）进行一趟希尔插入排序。 3、在主函数中控制程序执行流程。 4、时间复杂度：1≤k≤t≤[log2 (n+1)]时为O（n3/2）。
上传时间： 2013-12-11
上传用户：天涯
现在市面上流行的3D游戏画面越来越炫目，不过也有一些为了营造一种特殊的效果而使用了卡通渲染技术，比如PC游戏中的《杀手XIII》，《忍者神龟》；PS2游戏中的《真红之泪》，《犬夜叉》等等。这些游戏的画面看上去很像漫画，感觉比较有趣。下面就介绍一种简单的实现方法。 所谓用卡通渲染技术绘制的三维物体一般都有两个明显的特征，一个特征是物体表面覆盖着大块的单调颜色，而且光影变化比较剧烈；另一个特征是物体拥有粗重的边缘效果。如果能自己控制光照和阴影，就可以达到目的。而DirectX 9.0 中的顶点渲染(Vertex Shaders)提供了这样一个途径，使我们可以实现自己的想法。 顶点渲染与以前的T&L在渲染流程中处于二选一的地位，一段代码最多只能有128条指令，而且不能有循环，判断和跳转指令，全是线性执行指令。每次只能有一个Shader程序是激活的，Vertex Shaders让我们可以实时地控制模型的空间变换，光照处理以及像素渲染。 那么现在先来解决第一个问题。我们可以用光线的亮度值作为物体的纹理坐标，这就产生一种带状纹理的效果，然后再调整相应的颜色即可。
上传时间： 2013-12-10
上传用户：ruan2570406
These instructions assume that the 1.4 versions of the java and appletviewer commands are in your path. If they aren t, then you should either specify the complete path to the commands or update your PATH environment variable as described in the installation instructions for the Java 2 SDK.
标签： instructions appletviewer the commands
上传时间： 2015-06-01
上传用户：3到15
能自动计算总分、平均分及格率等各种统计数据。在统计时你还可以选择统计全部学科或部分学科；在使用中可自由增删成绩、人员，学科，及学科改名功能；自由设置卷面总分、及格线、分数段间隔、综合分，学校名，用户名，背景等. vqqq自动取款机 (A.T.M.).exe是一个银行的 自动取款机 (A.T.M.) 程序，可以让你在电脑上取银行的钱，只要有密码就可以 59r.com_CD播放器.exe是一个非常不错的 免费 CD播放器，超级酷，可以播放你的 cd ，有很多工能呀!
上传时间： 2015-06-04
上传用户：yangbo69
