rustkas / Hands-On-Data-Structures-and-Algorithms-in-Rust

Hands-On Data Structures and Algorithms in Rust [Video], published by Packt

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Hands-On Data Structures and Algorithms in Rust

Hands-On Data Structures and Algorithms in Rust [Video], published by Packt

This is the code repository for Hands-On Data Structures and Algorithms in Rust [Video], published by Packt. It contains all the supporting project files necessary to work through the video course from start to finish.

About the Video Course

Rust is a modern systems programming language designed with safety to simplify the development of large, complex software projects. Data structure and Algorithms are key to help in the collection and organization of the data for performing operations on the data and set instructions/logic to accomplish tasks in these projects. This course will be your guide for implementing classic data structures and algorithms in Rust, helping you to get up and running as a confident Rust programmer.

You will begin with a primer to Rust and its syntax. You will then explore the language of Time and Memory complexity by comparing different sorting methods. You’ll then learn about Lists and Binary Trees, implement them, and compare them, to show the advantages and use cases of each. Next, you will cover different algorithms in-depth such as sorting, graph, dynamic programming, greedy, divide and conquer, and more. You will learn how counterintuitive techniques can actually make it easier to build scalable projects!

By the end of the course, you will have a sound knowledge of the key data structures and algorithms in Rust to confidently implement them in your applications.

  • Creating and using variables in smart contracts
  • How Rust can help you keep your memory access safe and effective
  • How we can use Rust to build Generic Algorithms that we can use again and again across our codebase
  • Greedy, dynamic, and Iterative algorithms and when to use them
  • Different data structures such as Maps, Trees, and Linked lists, and when it is appropriate to use them.
  • Why and how an Entity Component System separates the different parts of the object into different storage areas
  • How we can build files that work like simple databases using BTrees
  • How we can run our programs even faster-using Multithreading

Assumed Knowledge

This course is for programmers who want to get to grips with all data structures and algorithms in the latest version of Rust programming language, to help organize your code better and accomplish predefined tasks.

No Rust programming knowledge is required as we will be covering the basics at the beginning.

Technical Requirements

Minimum Hardware Requirements For successful completion of this course, students will require the computer systems with at least the following:

OS: Windows, Linux, Mac Processor: Any

Recommended Hardware Requirements For an optimal experience with hands-on labs and other practical activities, we recommend the following configuration:

OS: Linux Processor: Any fast enough to run Rust Memory: Enough to run the Rust compiler. Storage: 2G

Software Requirements

Operating system: Browser: Any modern browser IDE : None Text: Editor, Any but one with Rust syntax highlighting preferred

Related Products

About

Hands-On Data Structures and Algorithms in Rust [Video], published by Packt

License:MIT License


Languages

Language:Rust 100.0%