This is the second part on my notes on creating a binary tree using an array in Swift. This is based on reading of Advanced Algorithms and Data Structures by Marcello La Rocca. In this article, I'll implement the code for the priority queue.
Read More

I recently started reading a book on Algorithms and Data Structures by Marcello La Rocca that I find fascinating. I'm going to take a deep dive into chapter 2 and adapt the pseudocode to implement a priority queue in Swift. This article will look at the properties of a priority queue and how this can be implemented …
Read More

The Swift standard library provides an ArraySlice to work with a subset of a larger collection without the overhead of making a copy of the original collection. Retrieving the first few elements of a collection can be achieved using the one-sided range operator, but is safer to use the prefix method without having to …
Read More