Hands-On Data Structures and Algorithms with Rust

✍ Scribed by Claus Matzinger

• Publisher: Packt Publishing Ltd.
• Year: 2019
• Tongue: English
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Table of Contents
1: HELLO RUST!
2: CARGO AND CRATES
3: STORING EFFICIENTLY
4: LISTS, LISTS, AND MORE LISTS
5: ROBUST TREES
6: EXPLORING MAPS AND SETS
7: COLLECTIONS IN RUST
8: ALGORITHM EVALUATION
9: ORDERING THINGS
10: FINDING STUFF
11: RANDOM AND COMBINATORIAL
12: ALGORITHMS OF THE STANDARD LIBRARY