This post is about a sorting algorithm called Insertion Sort with recursive and iterative implementations in Rust.
Write XML Tags using Closure in Rust – No Element End Tags
Did you miss writing out an XML element end tag in your Rust codes? There is a convenient way to avoid this in Rust using Closure.
Quicksort Algorithm Example in Rust
This post is about an example of the Quicksort algorithm in Rust. It sorts an array of i32 with 13 elements.
Merge Sort Algorithm in Rust Codes
Merge Sort is an algorithm invented by John von Neumann in 1945 and it is one of the most efficient sorting algorithms. It uses the principle of divide-and-conquer.
Rust – Mutable and Shared Borrowing
There are two types of borrowing in Rust – mutable and shared borrowing.
Async Fn and Await Example in Rust That’ll Open Your Mind
This post provides an example the uses async, async fn, and await for asynchronous processing. The sample codes use the futures crate to block the main function until the asynchronous function completes execution.
Rust – Read EPCIS 1.2 XML Into Struct Instance
This post is about reading an EPCIS 1.2 XML in a Struct instance.
Secure Actix-Web Application With TLS
This post demonstrates how to secure a Actix-web web application in Rust.
Rust – Fibonacci using Recursion and Iteration
This post is about simple Fibonacci implementations in Rust using recursion and iteration. It also shows which one is faster than the other using differences of start and end times.
Create Threads That Work With Data in Rust
Rust supports the creation of threads to run code simultaneously using the spawn function and a closure argument.