籌款 9月15日 2024 – 10月1日 2024 關於籌款

Data Structure Techniques

  • Main
  • Data Structure Techniques

Data Structure Techniques

Thomas A. Standish
你有多喜歡這本書?
文件的質量如何?
下載本書進行質量評估
下載文件的質量如何?
This book is about the creation and analysis of efficient data structures. It covers: the primitive node structure; asymptotic notation for mathematically discussing performance characteristics; built-in arrays; list structures built from either nodes or arrays; iterators as an abstract model of enumerating the items in a sequence; stacks and queues for computing with last-in/first-out and first-in/first-out orderings; binary and general tree structures for searching or representing hierarchical relationships; min and max heaps for representing ordering based on priorities; graph structures for representing more general relationships between data elements; hash tables for the efficient retrieval of strings and other objects; and finally trade-offs between the structures, and strategies for picking the most appropriate ones. To understand the material in this book you should be comfortable enough in a programming language to be able to work with and write your own variables, arithmetic expressions, if-else conditions, loops, subroutines (also known as functions), pointers (also known as references or object handles), structures (also known as records or classes), simple input and output, and simple recursion. Because many different languages approach the construction of data structures differently, we use pseudo-code so that you can translate the code into your own language.
年:
1980
出版商:
Addison-Wesley
語言:
english
頁數:
447
ISBN 10:
0201072564
ISBN 13:
9780201072563
文件:
DJVU, 6.68 MB
IPFS:
CID , CID Blake2b
english, 1980
線上閱讀
轉換進行中
轉換為 失敗

最常見的術語