- Hands-On Data Structures and Algorithms with Rust
- Claus Matzinger
- 137字
- 2021-07-02 14:11:52
Wrap up
A (transaction) log is a great use case for a linked list: They often grow to unexpected sizes, and indexing is not required. While a linked list is often a very simple type in other languages, it harbors a surprising amount of challenges in Rust. This is mostly due to the borrowing and ownership concepts which require a programmer to think about what goes where in great detail. For real-world use cases, however, it's better to use Rust's standard library linked list (std::collections::LinkedList). From a performance perspective, finding a particular item in the singly linked list requires looking at the entire list in the worst case, resulting in a runtime complexity of O(n), with n being the number of items in the list (more on the topic of runtime complexity in Chapter 8, Algorithm Evaluation).
- 我們都是數據控:用大數據改變商業、生活和思維方式
- PyTorch深度學習實戰:從新手小白到數據科學家
- SQL查詢:從入門到實踐(第4版)
- 算法與數據中臺:基于Google、Facebook與微博實踐
- Enterprise Integration with WSO2 ESB
- 跟老男孩學Linux運維:MySQL入門與提高實踐
- 數據庫技術及應用教程
- Spark分布式處理實戰
- Arquillian Testing Guide
- MySQL 8.0從入門到實戰
- SQL應用開發參考手冊
- 工業大數據工程:系統、方法與實踐
- Hands-On Big Data Analytics with PySpark
- 大數據:從海量到精準
- Hadoop與大數據挖掘