ANNUAL REPORT TO CONGRESS The Military Power of the People’s Republic of China 2005
標簽： CONGRESS Military Republic ANNUAL
上傳時間： 2013-12-27
上傳用戶：zhengzg
Ion Team Lord Of The Rings Demo 模擬指環王的3D游戲 VS.NET編譯 里面提供高級渲染算法
上傳時間： 2014-09-09
上傳用戶：zq70996813
ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an output file. • Assume a file with correct data (no garbage, characters, etc.). • you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour: o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the next size for the next 2 matrices (if not end of file). o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and discard the next (size2 ) integers and continue by reading the next size for the next 2 matrices (if not end of file).
標簽： multiplication Implement matrices matrix
上傳時間： 2014-08-30
上傳用戶：dsgkjgkjg
A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
標簽： bit collection including addition
上傳時間： 2015-05-17
上傳用戶：cursor
The Art Of C++ 此書的源碼，經典！里面，實現了個建議的MiniC++的代碼，值得一提的是，此MiniC++是解釋性的
上傳時間： 2015-05-17
上傳用戶：xiaoxiang
This sample demonstrates the use of the projection objects ProjCoordSys and GeoCoordSys, and the CoordinateSystem property of the MapLayer object and Map control. This application is intended to teach about the different world projections and there uses.
標簽： the ProjCoordSys demonstrates GeoCoordSys
上傳時間： 2015-05-17
上傳用戶：363186
Xilinx ISE 官方源代碼盤第七章 Part 2
上傳時間： 2015-05-17
上傳用戶：Breathe0125
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
十部經典算法合集 .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
標簽： Fundamentals Structures Horowitz PREFACE
上傳時間： 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.
標簽： introduction important you to
上傳時間： 2013-12-22
上傳用戶：youmo81
