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.
Book DescriptionRust 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.
What you will learn
Design and implement complex data structures in Rust
Analyze, implement, and improve searching and sorting algorithms in Rust
Create and use well-tested and reusable components with Rust
Understand the basics of multithreaded programming and advanced algorithm design
Become familiar with application profiling based on benchmarking and testing
Explore the borrowing complexity of implementing algorithms
Who this book is forThis book is for developers seeking to use Rust solutions in a practical/professional setting; who wants to learn essential Data Structures and Algorithms in Rust. It is for developers with basic Rust language knowledge, some experience in other programming languages is required.
Sprache
Verlagsort
Maße
Höhe: 235 mm
Breite: 191 mm
Dicke: 18 mm
Gewicht
ISBN-13
978-1-78899-552-8 (9781788995528)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Claus Matzinger is a software engineer with a very diverse background. After working in a small company maintaining code for embedded devices, he joined a large corporation to work on legacy Smalltalk applications. This led to a great interest in programming languages early on, and Claus became the CTO for a health games start-up based on Scala technology. Since then, Claus' roles have shifted toward customer-facing roles in the IoT database-technology start-up crate.io and, most recently, Microsoft. There, he hosts a podcast, writes code together with customers, and blogs about the solutions arising from these engagements. For more than 5 years, Claus has implemented software to help customers innovate, achieve, and maintain success.
Table of Contents
Hello Rust!
Crates, Cargo, And The Ecosystem
Storing Efficiently
Lists, Lists, More Lists
Robust Trees
Exploring Maps and Sets
Rust's std::collections
Algorithm Evaluation
Finding Stuff
Ordering Things
Random and Combinatorial
Algorithms of std::collections
