- Hands-On Data Structures and Algorithms with Rust
- Claus Matzinger
- 122字
- 2021-07-02 14:11:52
Upsides
The main benefits of a linked list are the abilities to grow very large in size cheaply, always maintain a certain direction, and allow to access items individually. What makes this data structure unique?
There are a few points:
- Low overhead allocation per item.
- Item count is only limited by heap memory.
- Mutation while iterating is possible.
- A direction is strictly enforced—there is no going back.
- Implementation is fairly simple (even in Rust).
- Efficient append, prepend, delete, and insert operations—compared to an array (no shifting required).
Generally, the linked list performs well in an environment where limited memory does not allow overhead allocation (as dynamic arrays do), or as a basis for an exotic lock-free data structure.
推薦閱讀
- 數據要素安全流通
- Unity 5.x Game AI Programming Cookbook
- Modern Programming: Object Oriented Programming and Best Practices
- Architects of Intelligence
- PySpark大數據分析與應用
- Hadoop大數據實戰權威指南(第2版)
- 跟老男孩學Linux運維:MySQL入門與提高實踐
- 基于OPAC日志的高校圖書館用戶信息需求與檢索行為研究
- SQL優化最佳實踐:構建高效率Oracle數據庫的方法與技巧
- Python數據分析與挖掘實戰(第3版)
- Spark分布式處理實戰
- 智能與數據重構世界
- 一本書讀懂區塊鏈(第2版)
- 大學計算機:理解和運用計算思維
- Hive性能調優實戰