Implementing Standard Algorithms in Rust: Heap Sort, Binary Search
This is a follow-up post of a practical session belonging to my introduction to Rust that started here. In the previous post we looked at the Merge Sort and the Quick Sort (see here). Next, let us implement the Heap Sort and the Binary Search. You may see it as an exercise and first try it by yourself. The best way of getting into Rust is by practicing things.