SwiftStructures v4.1 Release Notes
Release Date: 2018-01-09 // about 6 years ago-
This is a quick note announcing an updated version of the Swift Algorithms Book. For those whoโve previously purchased the PDF version , all reference materials (including further reading) are now hyperlinked. Chapter headings are also clickable to specific sections in the document. Changes to both the EPUB and PDF versions include the following:
๐ Revised LinkList.remove(at:) algorithm
๐ Renamed methods for HashTable algorithm and Keyable Protocol
Revised content for Stacks & Queues
Revised content for Basic Sorting
Previous changes from v4.0
-
Swift 4.0 is now officially released! As a result, The Swift Algorithms project has been updated to reflect this new standard.
๐ Change Summary
The relative stability of Swift 4.0 has allowed an opportunity refine many areas of the code base. Notable updates include:
- ๐ New examples of code Memoization and Dynamic Programming
- ๐ New non-recursive Binary Search Tree Algorithm (BST)
- ๐ New
contains()
method for BST's. - ๐ New generic
min/max
Heap Algorithm - ๐ New unit test cases for evaluating Fibonacci and Heap Algorithms
subscript
syntax applied toTrie
andLinked List
algorithms- ๐ Support for new Swift-based
Array.swapAt
function - Limited use of Implicit Unwrapped Optionals (IUO's)
Existing Swift 3.0 followers should study the new Swift 4.0 BST Algorithm. To simulate a
call stack
often employed in recursive processes, this model uses a customStack
data structure in conjunction withinout
variables.Follow the latest Swift 4.0 code updates from the master branch. If you have questions or would like submit a pull request, please do so using the develop branch.