Matzinger C. Hands-On Data Structures and Algorithms with Rust

Birmingham (UK): Packt Publishing Ltd., 2019. — 305 p. — ISBN: 978-1-78899-552-8.Design and implement professional level programs by exploring modern data structures and algorithms in Rust.Key Features- Use data structures such as arrays, stacks, trees, lists and graphs with real-world examples
- Learn the functional and reactive implementations of the traditional data structures
- Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner.
Rust has come a long way and is now utilized in several contexts. Its key strengths are its software infrastructure and resource-constrained applications, including desktop applications, servers, and performance-critical applications, not forgetting its importance in systems' programming. This book will be your guide as it takes you through implementing classic data structures and algorithms in Rust, helping you to get up and running as a confident Rust programmer.
The book begins with an introduction to Rust data structures and algorithms, while also covering essential language constructs. You will learn how to store data using linked lists, arrays, stacks, and queues. You will also learn how to implement sorting and searching algorithms. You will learn how to attain high performance by implementing algorithms to string data types and implement hash structures in algorithm design. The book will examine algorithm analysis, including Brute Force algorithms, Greedy algorithms, Divide and Conquer algorithms, Dynamic Programming, and Backtracking.
By the end of the book, you will have learned how to build components that are easy to understand, debug, and use in different applications.Hello Rust!
Rust in 2018
Borrowing and ownership
Concurrency and mutability
Deeper into RustQuestions
Further readingCargo and Crates
Cargo
CratesQuestions
Further readingStoring Efficiently
Heaps and stacks
Copying and cloning
Immutable storageQuestions
Further readingLists, Lists, and More Lists
Linked lists
Doubly linked list
Skip lists
Dynamic arraysQuestions
Further readingRobust Trees
Binary search tree
Red-black tree
Heaps
Trie
B-Tree
GraphsQuestionsExploring Maps and Sets
Hashing
Maps
SetsQuestions
Further readingCollections in Rust
Sequences
Maps and setsQuestions
Further readingAlgorithm Evaluation
The Big O notation
In the wildQuestions
Further readingOrdering Things
From chaos to orderQuestions
Further readingFinding Stuff
Finding the bestQuestions
Further readingRandom and Combinatorial
Pseudo-random numbers
Back to front
Advanced problem solvingQuestions
Further readingAlgorithms of the Standard Library
Slicing and iteration
Search
SortingQuestionsFurther reading
Appendix A: Assessments
Other Books You Map Enjoy
Index