- 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.
推薦閱讀
- GitHub Essentials
- 數據浪潮
- 數據存儲架構與技術
- Visual Studio 2015 Cookbook(Second Edition)
- 大數據導論
- 大數據算法
- Creating Dynamic UIs with Android Fragments(Second Edition)
- Mockito Cookbook
- Ceph源碼分析
- 數字媒體交互設計(初級):Web產品交互設計方法與案例
- Oracle PL/SQL實例精解(原書第5版)
- PostgreSQL指南:內幕探索
- INSTANT Android Fragmentation Management How-to
- 數據科學實戰指南
- Python數據分析與數據化運營