Hands-On Data Structures and Algorithms in Rust

Unlock the power of Rust for robust software development! This course guides you through implementing fundamental data structures and algorithms in the modern systems programming language, Rust. Build confidence as a Rust programmer by mastering core concepts essential for managing data and creating efficient solutions for large, complex projects.

We start with a clear Rust primer, covering essential syntax to get you started. Then, delve into the crucial concepts of time and memory complexity, comparing various sorting methods to optimize your code.

You'll gain hands-on experience with implementing and comparing key data structures like lists and binary trees, understanding their strengths and ideal use cases.

The course then explores a wide range of essential algorithms in depth, including:

• Sorting algorithms: Understand and implement efficient sorting techniques.
• Graph algorithms: Solve problems involving networks and relationships.
• Dynamic programming: Optimize solutions by breaking down problems into smaller overlapping subproblems.
• Greedy algorithms: Make locally optimal choices to find a global optimum.
• Divide and conquer: Recursively solve problems by breaking them into smaller, independent subproblems.

Discover how seemingly counterintuitive techniques can lead to more scalable and maintainable projects.

By the end of this course, you'll possess a solid understanding of key data structures and algorithms in Rust, empowering you to confidently implement them in your own applications.

Taught by Matthew Stoodley, a programming expert and enthusiast with experience in Rust, Go, PHP, and JavaScript. Matthew was initially drawn to Rust for its low power usage and memory safety, and now uses it extensively for building board games.