Sorting is one of the most important skills you can learn to make sense of messy data—and in this liveProject, you’ll discover sorting algorithms you can implement with Rust. You don’t need advanced Rust knowledge. With only the basics, you’ll tackle three of the huge number of sorting algorithms available: bubble sort, quicksort, and counting sort. But that’s not all: You’ll also experiment with a pair of search algorithms for linear and binary search. Before long, you’ll have an excellent grasp of the best sort and search algorithms for your needs.

The Tower of Hanoi is one of the most famous (and fun!) mathematical puzzles you can tackle. In this liveProject, you’ll set out to solve this tricky challenge using recursive functions in the Rust programming language. Kickstart your journey with factorials, then calculate Fibonacci numbers and solve the Knight’s Tour and N-Queens problems. Then, you’ll be ready to take on the Tower of Hanoi—and transfer your new recursion skills to multiple other problems.

In this liveProject, you’ll use Rust and RSA encryption to secure the emails of your antique marble collection business. You’ll steadily build up different parts of the RSA encryption process before bringing each together in a working RSA example that can both encrypt and decrypt your email messages. Throughout the journey, you will acquire knowledge about prime number identification, factoring, probabilistic generation of random primes, and rapid exponentiation techniques.

When your house is on fire, and you need to save your priceless art in a panic room, what are you going to do? Write a Rust program to solve the “knapsack problem” of course! In this liveProject, you’ll tackle this problem—one of the more challenging ones in computer science. The knapsack problem is known for its difficulty, as its possible solutions grow exponentially as the number of items increases. You’ll work with different methods to solve the problem, including recursion and dynamic programming techniques.