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.
標(biāo)簽： available libraries Although nearly
上傳時(shí)間： 2014-01-22
上傳用戶：zhoujunzhen
十部經(jīng)典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER
標(biāo)簽： Fundamentals Structures Horowitz PREFACE
上傳時(shí)間： 2015-05-19
上傳用戶：維子哥哥
In this book, we aim to give you an introduction to a wide variety of topics important to you as a developer using UNIX. The word Beginning in the title refers more to the content than to your skill level. We ve structured the book to help you learn more about what UNIX has to offer, however much experience you have already. UNIX programming is a large field and we aim to cover enough about a wide range of topics to give you a good beginning in each subject.
標(biāo)簽： introduction important you to
上傳時(shí)間： 2013-12-22
上傳用戶：youmo81
Linux管理員手冊(cè),操作系統(tǒng)提供的主要服務(wù)明實(shí)現(xiàn)這些服務(wù)的程序 with a considerable lack of detail目的是理解系統(tǒng)整體
標(biāo)簽： considerable detail Linux with
上傳時(shí)間： 2014-01-04
上傳用戶：woshiayin
Research on some key technologies of QoS provisioning for mobile AD-HOC networks
標(biāo)簽： provisioning technologies Research networks
上傳時(shí)間： 2013-12-17
上傳用戶：change0329
a kind of RTOS souce code for ARM
標(biāo)簽： souce kind RTOS code
上傳時(shí)間： 2014-01-23
上傳用戶：xg262122
some books and papers of SVM for regression
標(biāo)簽： regression papers books some
上傳時(shí)間： 2013-12-16
上傳用戶：xiaodu1124
高等通信原理16_QAM symbol sequence of 2000 symbols and plot the constellation
標(biāo)簽： constellation sequence symbols symbol
上傳時(shí)間： 2013-12-30
上傳用戶：wfl_yy
eForth is a small portable Forth design for a wide range of microprocessors. This is the first implementation for 8086. As machine dependency is consolidated into 31 code words, moving eForth to other CPU s will be much less of a chore comparing to other Forth models.
標(biāo)簽： microprocessors portable eForth design
上傳時(shí)間： 2014-01-25
上傳用戶：從此走出陰霾
Excel spreadsheet allowing calculation of the best R-C-C component values on the PLL Loop Back Filter.
標(biāo)簽： spreadsheet calculation component the
上傳時(shí)間： 2014-01-14
上傳用戶：冇尾飛鉈
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
